Sciweavers

6045 search results - page 80 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ICCSA
2003
Springer
14 years 1 months ago
Coupling Tangent-Linear and Adjoint Models
Abstract. We consider the solution of a (generalized) eigenvalue problem arising in physical oceanography that involves the evaluation of both the tangent-linear and adjoint versio...
Uwe Naumann, Patrick Heimbach
DAC
2000
ACM
14 years 8 days ago
An asymptotically constant, linearly bounded methodology for the statistical simulation of analog circuits including component m
Abstract: This paper presents a new statistical methodology to simulate the effect of both inter-die and intra-die variation on the electrical performance of analog integrated circ...
Carlo Guardiani, Sharad Saxena, Patrick McNamara, ...
IPPS
1999
IEEE
14 years 5 days ago
Linear Aggressive Prefetching: A Way to Increase the Performance of Cooperative Caches
Cooperative caches offer huge amounts of caching memory that is not always used as well as it could be. We might find blocks in the cache that have not been requested for many hou...
Toni Cortes, Jesús Labarta
MP
1998
83views more  MP 1998»
13 years 7 months ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
PAMI
2002
103views more  PAMI 2002»
13 years 7 months ago
Digital Curves in 3D Space and a Linear-Time Length Estimation Algorithm
We consider simple digital curves in a 3D orthogonal grid as special polyhedrally bounded sets. These digital curves model digitized curves or arcs in three-dimensional euclidean ...
Thomas Bülow, Reinhard Klette