Sciweavers

4255 search results - page 34 / 851
» Cover
Sort
View
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
13 years 11 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
SIROCCO
2010
13 years 9 months ago
On the Impact of Local Taxes in a Set Cover Game
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
Bruno Escoffier, Laurent Gourvès, Jé...
ECIR
2006
Springer
13 years 9 months ago
Towards Automatic Retrieval of Album Covers
We present first steps towards intelligent retrieval of music album covers from the web. The continuous growth of electronic music distribution constantly increases the interest in...
Markus Schedl, Peter Knees, Tim Pohle, Gerhard Wid...
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
13 years 7 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts
ECCC
2007
96views more  ECCC 2007»
13 years 7 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky