Sciweavers

1612 search results - page 261 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
COLT
2008
Springer
14 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
ECAI
2010
Springer
14 years 11 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»
14 years 10 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...
TPDS
2008
116views more  TPDS 2008»
14 years 9 months ago
A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions
Media distribution through application-layer overlay networks has received considerable attention recently, owing to its flexible and readily deployable nature. On-demand streaming...
Dan Wang, Jiangchuan Liu
PIMRC
2010
IEEE
14 years 7 months ago
On the feasibility of receive collaboration in wireless sensor networks
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
Behnam Banitalebi, S. Sigg, M. Beigl