Sciweavers

2924 search results - page 29 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
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...
Samee Ullah Khan, Ishfaq Ahmad
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 8 months ago
Lower Bounds on the Rate-Distortion Function of Individual LDGM Codes
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...
Shrinivas Kudekar, Rüdiger L. Urbanke
DAC
1999
ACM
14 years 1 months ago
Using Lower Bounds During Dynamic BDD Minimization
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...
Rolf Drechsler, Wolfgang Günther
INFOCOM
2005
IEEE
14 years 2 months ago
Low-state fairness: lower bounds and practical enforcement
— 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 ...
Abhimanyu Das, Debojyoti Dutta, Ahmed Helmy, Ashis...