5153 search results - page 200 / 1031 » Introduction to Randomized Algorithms |
137
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
124
click to vote
EUROCRYPT
2004
Springer
15 years 8 months ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
113
click to vote
SAT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
142
click to vote
FSTTCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
136
click to vote
ICPR
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper presents a Hidden Markov Mesh Random Field (HMMRF) based approach for off-line handwritten Chinese characters recognition using statistical observation sequences embedd...