2924 search results - page 29 / 585 » Lower Bounds in Distributed Computing |
170
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
182
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- We consider lossy compression of a binary symmetric source by means of a low-density generator-matrix code. We derive two lower bounds on the rate distortion function wh...
201
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
176
Voted
INFOCOM
2005
IEEE
16 years 12 days ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...