107 search results - page 4 / 22 » Random sampling and approximation of MAX-CSP problems |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
CSE
2008
IEEE
13 years 7 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
ICASSP
2011
IEEE
12 years 11 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...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
FOCS
2000
IEEE
13 years 12 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...