381 search results - page 6 / 77 » Fast Neighbor Joining |
PODS
1999
ACM
15 years 2 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
WDAG
2004
Springer
15 years 3 months ago
2004
Springer
A central problem for structured peer-to-peer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join and leave the network, possibly c...
105
click to vote
DAMON
2008
Springer
14 years 11 months ago
2008
Springer
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
100
click to vote
CVPR
2012
IEEE
13 years 9 days ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...