6365 search results - page 1 / 1273 » Fast Local Computation Algorithms |
CORR
2011
Springer
12 years 12 months ago
2011
Springer
PAMI
2012
11 years 7 months ago
2012
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
ICIP
2006
IEEE
14 years 6 months ago
2006
IEEE
For the non-local denoising approach presented by Buades et al., remarkable denoising results are obtained at high expense of computational cost. In this paper, a new algorithm th...
ICAPR
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
GD
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...