518 search results - page 92 / 104 » Beating a Random Assignment |
STOC
2009
ACM
16 years 10 days ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
107
click to vote
PERCOM
2009
ACM
16 years 8 days ago
2009
ACM
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
105
click to vote
SIGMOD
2002
ACM
15 years 12 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
117
click to vote
PODS
2005
ACM
15 years 12 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
118
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Today the major web search engines answer queries by showing ten result snippets, which need to be inspected by users for identifying relevant results. In this paper we investigat...