7 search results - page 2 / 2 » Bregman vantage point trees for efficient nearest Neighbor Q... |
CCCG
2006
13 years 6 months ago
2006
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...