29 search results - page 1 / 6 » Random Projection Trees Revisited |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
NIPS
2007
14 years 11 months ago
2007
We present a simple variant of the k-d tree which automatically adapts to intrinsic low dimensional structure in data.
SODA
1998
ACM
14 years 10 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
112
click to vote
MMM
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
TOG
2008
14 years 9 months ago
2008
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...