361 search results - page 22 / 73 » Maximum subset intersection |
151
click to vote
IPCO
2008
15 years 3 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
ACL
2001
15 years 3 months ago
2001
In this paper we address the problem of extracting key pieces of information from voicemail messages, such as the identity and phone number of the caller. This task differs from t...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— We address data transmission over the M-user Gaussian interference channel, where users send data using single Gaussian codebooks. We first present a polynomial-time algorithm...
125
click to vote
STOC
2003
ACM
15 years 7 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
116
click to vote
DM
2010
15 years 2 months ago
2010
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...