Sciweavers

1541 search results - page 89 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
DCOSS
2006
Springer
15 years 8 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
15 years 6 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
JMLR
2012
13 years 7 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
CORR
2012
Springer
222views Education» more  CORR 2012»
14 years 6 days ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
ICCV
2009
IEEE
16 years 9 months ago
Correlated Probabilistic Trajectories for Pedestrian Motion Detection
This paper introduces an algorithm for detecting walking motion using point trajectories in video sequences. Given a number of point trajectories, we identify those which are sp...
Frank Perbet, Atsuto Maki, Bjorn Stenger