2107 search results - page 75 / 422 » Computing Small Search Numbers in Linear Time |
149
Voted
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
116
click to vote
CVPR
2009
IEEE
15 years 7 months ago
2009
IEEE
Visual tracking is a key component in many computer vision applications. Linear subspace techniques (e.g. eigentracking) are one of the most popular approaches to align templates ...
143
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
125
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
123
click to vote
CCGRID
2010
IEEE
15 years 3 months ago
2010
IEEE
—Despite extensive research focused on enabling QoS for grid users through economic and intelligent resource provisioning, no consensus has emerged on the most promising strategi...