20 search results - page 3 / 4 » Reverse Nearest Neighbors in Large Graphs |
ESANN
2007
13 years 7 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
CVPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
SPIRE
2009
Springer
14 years 27 days ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
TIP
2010
13 years 4 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
PPOPP
2010
ACM
14 years 3 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...