562 search results - page 49 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a probabilistic framework for off-line multiple object tracking. At each timestep, a small set of deterministic candidates is generated which is guaranteed to ...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Optimization algorithms for large margin multiclass recognizers are often too costly to handle ambitious problems with structured outputs and exponential numbers of classes. Optim...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...