Sciweavers

1381 search results - page 13 / 277
» Structural signatures for tree data structures
Sort
View
NIPS
2007
13 years 9 months ago
Learning the structure of manifolds using random projections
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.
Yoav Freund, Sanjoy Dasgupta, Mayank Kabra, Nakul ...
VLDB
2000
ACM
114views Database» more  VLDB 2000»
13 years 11 months ago
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem...
EUROCAST
2007
Springer
108views Hardware» more  EUROCAST 2007»
13 years 11 months ago
Pattern-Based Verification for Trees
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...
Milan Ceska, Pavel Erlebach, Tomás Vojnar
IV
2003
IEEE
91views Visualization» more  IV 2003»
14 years 27 days ago
Labeled Radial Drawing of Data Structures
This paper describes a radial layout method for displaying B+ -tree data structures. We present an algorithmic framework for computing the node positions that result in a planar d...
M. Bernard, S. Mohammed
DAGSTUHL
1996
13 years 9 months ago
Self-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Susanne Albers, Jeffery Westbrook