65 search results - page 5 / 13 » The power of choice in random walks: an empirical study |
AAAI
2011
13 years 9 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
AIRWEB
2005
Springer
15 years 3 months ago
2005
Springer
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
ML
2008
ACM
14 years 9 months ago
2008
ACM
Pattern discovery techniques, such as association rule discovery, explore large search spaces of potential patterns to find those that satisfy some user-specified constraints. Due...
81
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...