1806 search results - page 259 / 362 » Randomness and halting probabilities |
136
click to vote
SIGCOMM
2006
ACM
15 years 10 months ago
2006
ACM
A pervasive requirement of distributed systems is to deal with churn — change in the set of participating nodes due to joins, graceful leaves, and failures. A high churn rate ca...
130
click to vote
BROADNETS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
155
click to vote
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
145
click to vote
ECML
2004
Springer
15 years 9 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
157
click to vote
ISCC
2003
IEEE
15 years 9 months ago
2003
IEEE
We present a noiseless source coding problem in a broadcast environment and supply a simple solution to this problem. A transmitter wishes to transmit a binary random vector Ò ½...