Sciweavers

4208 search results - page 455 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
178
Voted
GPC
2007
Springer
15 years 10 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 10 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
ISPDC
2010
IEEE
15 years 2 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
TVCG
2010
186views more  TVCG 2010»
15 years 2 months ago
An Information-Theoretic Framework for Flow Visualization
—The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algori...
Lijie Xu, Teng-Yok Lee, Han-Wei Shen
ICDE
2011
IEEE
200views Database» more  ICDE 2011»
14 years 7 months ago
Deriving probabilistic databases with inference ensembles
— Many real-world applications deal with uncertain or missing data, prompting a surge of activity in the area of probabilistic databases. A shortcoming of prior work is the assum...
Julia Stoyanovich, Susan B. Davidson, Tova Milo, V...