Sciweavers

280 search results - page 27 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
AUSAI
2005
Springer
15 years 3 months ago
Semantic Correlation Network Based Text Clustering
Abstract. Text documents have sparse data spaces, and nearest neighbors may belong to different classes when using current existing proximity measures to describe the correlation ...
Shaoxu Song, Chunping Li
75
Voted
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 3 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
3DIM
2003
IEEE
15 years 1 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
90
Voted
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 3 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 5 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled