CORR
2010
Springer
13 years 4 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
CCGRID
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
UAI
2003
13 years 5 months ago
2003
We propose a framework to extend Markov random walks (Szummer and Jaakkola, 2001) to a continuum of points. In this framework, the transition probability between two points is the...
VMV
2001
13 years 5 months ago
2001
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
AIPS
2004
13 years 5 months ago
2004
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
CSC
2008
13 years 5 months ago
2008
I show how to design the value of the diffusion constant D for the random walks of Squares and Triangles over their respective regular lattice in two-dimensions. By allowing moveme...
ADHOCNOW
2010
Springer
13 years 5 months ago
2010
Springer
Random walks in wireless sensor networks can serve as fully local, very simple strategies for sink motion that reduce energy dissipation a lot but increase the latency of data coll...
EURONGI
2008
Springer
13 years 6 months ago
2008
Springer
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
EUROCOLT
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...