Sciweavers

1434 search results - page 213 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ICPPW
2002
IEEE
14 years 2 months ago
Statistical Analysis of Connectivity in Unidirectional Ad Hoc Networks
A unidirectional link exists in an ad-hoc network when a node B is within the transmission range of another node A while node A cannot directly hear node B. However, a reverse rou...
Venugopalan Ramasubramanian, Daniel Mossé
COLT
2008
Springer
13 years 11 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman
SIROCCO
2008
13 years 11 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
ECAI
2010
Springer
13 years 10 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 9 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...