5580 search results - page 245 / 1116 » Randomized priority algorithms |
157
click to vote
SAT
2004
Springer
15 years 11 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...
184
click to vote
FSTTCS
2001
Springer
15 years 10 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...
176
click to vote
ICPR
2000
IEEE
15 years 10 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...
169
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
173
click to vote
COMPGEOM
1998
ACM
15 years 10 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...