1284 search results - page 246 / 257 » Data Structures for Mergeable Trees |
SAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
VIS
2009
IEEE
15 years 11 months ago
2009
IEEE
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....
82
Voted
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...