99 search results - page 7 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
214
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
117
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
140
click to vote
CIKM
2010
Springer
15 years 17 days ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
KDD
2006
ACM
16 years 2 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
107
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...