7006 search results - page 920 / 1402 » Approximation Algorithms |
205
click to vote
APPROX
2006
Springer
15 years 11 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
301
click to vote
COMPGEOM
2011
ACM
14 years 11 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
270
click to vote
CVPR
2012
IEEE
13 years 10 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
214
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
194
click to vote
COLT
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...