1053 search results - page 143 / 211 » Shape as Memory Storage |
IWMM
2000
Springer
15 years 1 months ago
2000
Springer
We study the effectiveness of garbage collection (GC) algorithms by measuring the time difference between the actual collection time of an object and the potential earliest collec...
LCPC
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. The technique of flattening nested data parallelism combines all the independent operations in nested apply-to-all constructs and generates large amounts of potential pa...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
This paper presents a new functionality of the Automatic Differentiation (AD) Tool tapenade. tapenade generates adjoint codes which are widely used for optimization or inverse prob...
ICMCS
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
CAP
2010
14 years 4 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...