Sciweavers

1554 search results - page 250 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
CVPR
2010
IEEE
15 years 7 months ago
A Square-Root Sampling Approach to Fast Histogram-Based Search
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
Huang-Wei Chang, Hwann-Tzong Chen
ICASSP
2009
IEEE
15 years 6 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
ICB
2009
Springer
119views Biometrics» more  ICB 2009»
15 years 6 months ago
Multi-Region Probabilistic Histograms for Robust and Scalable Identity Inference
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
Conrad Sanderson, Brian C. Lovell
ARITH
2007
IEEE
15 years 6 months ago
Worst Cases of a Periodic Function for Large Arguments
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
Guillaume Hanrot, Vincent Lefèvre, Damien S...
SASO
2007
IEEE
15 years 6 months ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha