information-theoretic lower bounds

27

SIGECOM
2008
ACM

155views ECommerce» more SIGECOM 2008»

Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions

13 years 7 months ago

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...

Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...

claim paper

Read More »

20

click to vote

ACL
2007

130views Computational Linguistics» more ACL 2007»

Randomised Language Modelling for Statistical Machine Translation

13 years 8 months ago

Download aclweb.org

A Bloom ﬁlter (BF) is a randomised data structure for set membership queries. Its space requirements are signiﬁcantly below lossless information-theoretic lower bounds but it ...

David Talbot, Miles Osborne

claim paper

Read More »

19

click to vote

FOCS
2008
IEEE

79views Theoretical Computer Science» more FOCS 2008»

The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)

14 years 1 months ago

Download www2.lns.mit.edu

We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. �...

Michael Ben-Or, Avinatan Hassidim

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers