Sciweavers

FOCS
2000
IEEE
13 years 8 months ago
Cache-Oblivious B-Trees
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 ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...
ICSE
2010
IEEE-ACM
13 years 8 months ago
Dynamic symbolic data structure repair
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...
Ishtiaque Hussain, Christoph Csallner
ICPR
2002
IEEE
13 years 8 months ago
Exploratory Analysis of Point Proximity in Subspaces
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...
Tin Kam Ho
3DPVT
2002
IEEE
145views Visualization» more  3DPVT 2002»
13 years 8 months ago
Multiresolution Distance Volumes for Progressive Surface Compression
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...
Daniel E. Laney, Martin Bertram, Mark A. Duchainea...
PLDI
2010
ACM
13 years 8 months ago
Finding low-utility data structures
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...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
ESA
2003
Springer
117views Algorithms» more  ESA 2003»
13 years 8 months ago
Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
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 ...
Miguel Granados, Peter Hachenberger, Susan Hert, L...
ESA
2003
Springer
58views Algorithms» more  ESA 2003»
13 years 8 months ago
Kinetic Dictionaries: How to Shoot a Moving Target
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 ...
Mark de Berg
ECOOP
2003
Springer
13 years 8 months ago
LeakBot: An Automated and Lightweight Tool for Diagnosing Memory Leaks in Large Java Applications
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...
Nick Mitchell, Gary Sevitsky
VRST
2003
ACM
13 years 9 months ago
Interactive modeling of trees by using growth simulation
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...
Katsuhiko Onishi, Shoichi Hasuike, Yoshifumi Kitam...
TLDI
2003
ACM
134views Formal Methods» more  TLDI 2003»
13 years 9 months ago
Scrap your boilerplate: a practical design pattern for generic programming
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...
Ralf Lämmel, Simon L. Peyton Jones