1389 search results - page 82 / 278 » Improved Approximation Algorithms for Label Cover Problems |
139
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
127
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
142
click to vote
CSL
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
122
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
123
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...