5580 search results - page 772 / 1116 » Randomized priority algorithms |
139
Voted
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
145
Voted
VTS
2003
IEEE
15 years 9 months ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
115
Voted
CSCLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
127
Voted
IDA
2009
Springer
15 years 8 months ago
2009
Springer
We investigate the problem of source separation in images in the Bayesian framework using the color channel dependencies. As a case in point we consider the source separation of co...
147
Voted
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...