Sciweavers

1434 search results - page 82 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
MA
2010
Springer
140views Communications» more  MA 2010»
13 years 6 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
ICDCSW
2003
IEEE
14 years 1 months ago
An Adaptive Object Allocation and Replication Algorithm in Distributed Databases
In a Distributed Database System (DDBS), transactions on objects can be read requests or write requests in a random manner. The replication algorithm of objects critically affects...
Wujuan Lin, Bharadwaj Veeravalli
ICDCS
2005
IEEE
14 years 1 months ago
On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems
Data reliability of distributed brick storage systems critically depends on the replica placement policy, and the two governing forces are repair speed and sensitivity to multiple...
Qiao Lian, Wei Chen, Zheng Zhang
CACM
2008
53views more  CACM 2008»
13 years 7 months ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer