133 search results - page 8 / 27 » Approximation bounds for Black Hole Search problems |
ADC
2006
Springer
15 years 5 months ago
2006
Springer
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
91
Voted
PAMI
2011
14 years 6 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
115
click to vote
AI
2011
Springer
14 years 6 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
100
click to vote
ICML
2008
IEEE
16 years 14 days ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
81
Voted
ICRA
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...