12519 search results - page 135 / 2504 » Approximation Problems Categories |
173
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
177
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
208
click to vote
MOBICOM
2006
ACM
16 years 10 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
162
click to vote
MOC
2000
15 years 6 months ago
2000
Abstract. Finite element approximations for the Dirichlet problem associated to a second
171
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...