316 search results - page 28 / 64 » Bounded Depth Data Trees |
115
click to vote
EDBT
2006
ACM
16 years 1 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
174
click to vote
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
119
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
127
click to vote
SIAMCOMP
1998
15 years 29 days ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
106
click to vote
ALGORITHMICA
2005
15 years 1 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...