Sciweavers

5448 search results - page 622 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 11 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
CCGRID
2006
IEEE
16 years 1 months ago
Effective Load Balancing in P2P Systems
— In DHT based P2P systems, various issues such as peer heterogeneity, network topology, and diverse file popularity, may affect the DHT system efficiency. In this paper, we pr...
Zhiyong Xu, Laxmi N. Bhuyan
ICDCS
2003
IEEE
16 years 10 days ago
Performance Guarantees for Cluster-Based Internet Services
As web-based transactions become an essential element of everyday corporate and commerce activities, it becomes increasingly important that the performance of web-based services b...
Chang Li, Gang Peng, Kartik Gopalan, Tzi-cker Chiu...
AI
2010
Springer
15 years 7 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
ICDCS
2012
IEEE
13 years 9 months ago
MOVE: A Large Scale Keyword-Based Content Filtering and Dissemination System
—The Web 2.0 era is characterized by the emergence of a very large amount of live content. A real time and finegrained content filtering approach can precisely keep users upto-...
Weixiong Rao, Lei Chen 0002, Pan Hui, Sasu Tarkoma