5115 search results - page 422 / 1023 » On Randomized Lanczos Algorithms |
165
Voted
SODA
2004
ACM
15 years 9 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...
201
Voted
CRYPTO
2010
Springer
15 years 8 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...
209
Voted
COLOGNETWENTE
2009
15 years 8 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
198
click to vote
CVIU
2006
15 years 7 months ago
2006
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
174
click to vote
JCM
2007
15 years 7 months ago
2007
— This paper deals with the problem of blind carrier-frequency offset (CFO) estimation in OFDM systems based on offset quadrature amplitude modulation (OFDM/OQAM) with null subca...