Sciweavers

1612 search results - page 203 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
JODL
2006
88views more  JODL 2006»
15 years 2 months ago
BroadScale: Efficient scaling of heterogeneous storage systems
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
Shu-Yuen Didi Yao, Cyrus Shahabi, Roger Zimmermann
CCS
2010
ACM
15 years 1 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
SBIA
2004
Springer
15 years 7 months ago
Learning with Drift Detection
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Pedro Medas, Gladys Castillo, Pe...
MSS
2007
IEEE
85views Hardware» more  MSS 2007»
15 years 8 months ago
Providing Quality of Service Support in Object-Based File System
Bourbon is a quality of service framework designed to work with the Ceph object-based storage system. Ceph is a highly scalable distributed file system that can scale up to tens ...
Joel C. Wu, Scott A. Brandt
PCI
2005
Springer
15 years 8 months ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris