5115 search results - page 680 / 1023 » On Randomized Lanczos Algorithms |
170
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
: This paper presents a new tightly coupled computation/communication design developed to support the unique operational requirements of sensor webs. A critical challenge of sensor...
174
click to vote
ISCAS
2003
IEEE
15 years 12 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...
182
click to vote
VTS
2003
IEEE
15 years 12 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...
149
click to vote
CSCLP
2003
Springer
15 years 11 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 ...
169
click to vote
IDA
2009
Springer
15 years 11 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...