1329 search results - page 52 / 266 » Randomly Sampling Molecules |
FOCS
1990
IEEE
14 years 2 months ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
ALGORITHMICA
2008
13 years 10 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
SAC
2006
ACM
14 years 4 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
IMC
2006
ACM
14 years 4 months ago
2006
ACM
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...