Sciweavers

1434 search results - page 156 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
FTDCS
2004
IEEE
15 years 3 months ago
A New Perspective in Defending against DDoS
Distributed denial of service (DDoS) is a major threat to the availability of Internet services. The anonymity allowed by IP networking, together with the distributed, large scale...
Shigang Chen, Randy Chow
IPPS
2010
IEEE
14 years 9 months ago
DEBAR: A scalable high-performance de-duplication storage system for backup and archiving
We present DEBAR, a scalable and high-performance de-duplication storage system for backup and archiving, to overcome the throughput and scalability limitations of the state-of-th...
Tianming Yang, Hong Jiang, Dan Feng, Zhongying Niu...
OPODIS
2010
14 years 9 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
SAC
2011
ACM
14 years 6 months ago
Stochastic matching pursuit for Bayesian variable selection
This article proposes a stochastic version of the matching pursuit algorithm for Bayesian variable selection in linear regression. In the Bayesian formulation, the prior distributi...
Ray-Bing Chen, Chi-Hsiang Chu, Te-You Lai, Ying Ni...