574 search results - page 70 / 115 » Approximation Algorithms for Free-Label Maximization |
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
CVPR
2012
IEEE
11 years 11 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...
ICNP
2000
IEEE
14 years 1 months ago
2000
IEEE
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly designed to produce maximum margins. To deri...