Sciweavers

1612 search results - page 103 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
127
Voted
IPPS
2010
IEEE
15 years 8 days ago
Consistency in hindsight: A fully decentralized STM algorithm
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
Annette Bieniusa, Thomas Fuhrmann
91
Voted
CIKM
2009
Springer
15 years 9 months ago
On optimising personal network size to manage information flow
PN refer to the set of ties a specific individual has with other people. There is significant variation in the size of an individual’s PN and this paper explores the effect o...
Yu-En Lu, Sam Roberts, Tammy M. K. Cheng, Robin Du...
MONET
2006
141views more  MONET 2006»
15 years 2 months ago
An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objec...
Ritesh Madan, Sanjay Lall
PPSN
2004
Springer
15 years 7 months ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta
UAI
2004
15 years 3 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani