Sciweavers

85 search results - page 3 / 17
» Non Uniform Random Walks
Sort
View
AAAI
2004
13 years 7 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
RSA
2008
78views more  RSA 2008»
13 years 5 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák
MM
2006
ACM
190views Multimedia» more  MM 2006»
13 years 11 months ago
Image annotation refinement using random walk with restarts
Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefo...
Changhu Wang, Feng Jing, Lei Zhang, HongJiang Zhan...
WIA
2009
Springer
14 years 11 days ago
Random Generation of Deterministic Tree (Walking) Automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
HICSS
2006
IEEE
152views Biometrics» more  HICSS 2006»
13 years 12 months ago
Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan...