2095 search results - page 36 / 419 » Improved pebbling bounds |
MONET
2011
13 years 4 months ago
2011
— We investigate the throughput improvement that ZIGZAG decoding (Gollakota and Katabi (2008)) can achieve in multi-user random access systems. ZIGZAG is a recently proposed 802....
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
ECCC
2011
13 years 1 months ago
2011
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.