661 search results - page 38 / 133 » On Distributed Computation in Noisy Random Planar Networks |
164
Voted
NECO
2011
14 years 11 months ago
2011
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...
158
Voted
GI
2003
Springer
15 years 9 months ago
2003
Springer
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
119
click to vote
SSS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
155
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
111
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...