Sciweavers

400 search results - page 54 / 80
» Lower Bounds Using Kolmogorov Complexity
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
FOCS
1999
IEEE
14 years 1 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
IPPS
2006
IEEE
14 years 2 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 9 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
On Outage and Error Rate Analysis of the Ordered V-BLAST
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...
Sergey Loyka, François Gagnon