324 search results - page 34 / 65 » Distance Approximating Trees: Complexity and Algorithms |
175
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
160
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
164
click to vote
ALGORITHMICA
2005
15 years 5 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
162
click to vote
INFOCOM
2002
IEEE
15 years 10 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
126
click to vote
NIPS
2007
15 years 6 months ago
2007
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...