Sciweavers

13214 search results - page 370 / 2643
» Pseudorandomness for network algorithms
Sort
View
DSN
2004
IEEE
15 years 10 months ago
A Decentralized Algorithm for Erasure-Coded Virtual Disks
A Federated Array of Bricks is a scalable distributed storage system composed from inexpensive storage bricks. It achieves high reliability with low cost by using erasure coding a...
Svend Frølund, Arif Merchant, Yasushi Saito...
184
Voted
TON
2002
170views more  TON 2002»
15 years 6 months ago
The BLUE active queue management algorithms
In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF has been considering the deployment of active queue management tech...
Wu-chang Feng, Kang G. Shin, Dilip D. Kandlur, Deb...
SPAA
2009
ACM
16 years 7 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
ICDM
2003
IEEE
107views Data Mining» more  ICDM 2003»
16 years 3 days ago
Objective and Subjective Algorithms for Grouping Association Rules
We propose two algorithms for grouping and summarizing association rules. The first algorithm recursively groups rules according to the structure of the rules and generates a tre...
Aijun An, Shakil M. Khan, Xiangji Huang
APPROX
2000
Springer
122views Algorithms» more  APPROX 2000»
15 years 11 months ago
An approximation algorithm for the fault tolerant metric facility location problem
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Kamal Jain, Vijay V. Vazirani