5153 search results - page 429 / 1031 » Introduction to Randomized Algorithms |
157
Voted
SODA
2007
ACM
15 years 6 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
145
click to vote
DAGSTUHL
2004
15 years 6 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
225
click to vote
ESANN
2003
15 years 6 months ago
2003
Abstract. We study various ensemble methods for hybrid neural networks. The hybrid networks are composed of radial and projection units and are trained using a deterministic algori...
122
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
147
click to vote
CRYPTO
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...