Sciweavers

4377 search results - page 157 / 876
» Mass problems and randomness
Sort
View
AAAI
2004
15 years 8 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
NIPS
2001
15 years 7 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola
CORR
2008
Springer
103views Education» more  CORR 2008»
15 years 6 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
CRYPTO
2009
Springer
82views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
Solving Hidden Number Problem with One Bit Oracle and Advice
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
Adi Akavia
CVPR
2007
IEEE
16 years 8 months ago
Physics-Based Person Tracking Using Simplified Lower-Body Dynamics
We introduce a physics-based model for 3D person tracking. Based on a biomechanical characterization of lower-body dynamics, the model captures important physical properties of bi...
Marcus A. Brubaker, David J. Fleet, Aaron Hertzman...