2996 search results - page 147 / 600 » Numberings and Randomness |
171
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
160
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
133
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
156
click to vote
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
133
click to vote
CPC
1998
15 years 5 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...