170 search results - page 3 / 34 » Amortised Memory Analysis Using the Depth of Data Structures |
119
click to vote
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
117
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
147
click to vote
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
Specular reflections present difficulties for many areas of computer vision such as stereo and segmentation. To separate specular and diffuse reflection components, previous approa...
116
click to vote
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
This paper describes a monitoring environment that enables the analysis of memory access behavior of applications in a selective way with a potentially very high degree of detail. ...
115
click to vote
ATVA
2009
Springer
15 years 9 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...