FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
ICSE
2010
IEEE-ACM
14 years 6 days ago
2010
IEEE-ACM
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
ICPR
2002
IEEE
14 years 11 days ago
2002
IEEE
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
3DPVT
2002
IEEE
14 years 12 days ago
2002
IEEE
We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topolo...
PLDI
2010
ACM
14 years 15 days ago
2010
ACM
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
ESA
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef ...
ESA
2003
Springer
14 years 19 days ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
ECOOP
2003
Springer
14 years 19 days ago
2003
Springer
Despite Java’s automatic reclamation of memory, memory leaks remain an important problem. For example, we frequently encounter memory leaks that cause production servers to crash...
VRST
2003
ACM
14 years 20 days ago
2003
ACM
We propose a real-time interactive system that enables users to generate, manipulate and edit the shape model of a tree based on growth simulation by directly indicating its globa...
TLDI
2003
ACM
14 years 20 days ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...