1389 search results - page 114 / 278 » Improved Approximation Algorithms for Label Cover Problems |
149
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
135
click to vote
SIAMDM
2000
15 years 3 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
120
click to vote
AAAI
1994
15 years 4 months ago
1994
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
133
click to vote
AAAI
2012
13 years 5 months ago
2012
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
128
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...