2570 search results - page 160 / 514 » Fast Algorithms For The Computation Of Ranklets |
152
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
132
Voted
CGI
1998
IEEE
15 years 7 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
124
click to vote
ANTS
2004
Springer
15 years 8 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
132
click to vote
PPAM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
154
click to vote
BCS
2008
15 years 4 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...