5115 search results - page 467 / 1023 » On Randomized Lanczos Algorithms |
193
Voted
FOCS
2008
IEEE
16 years 2 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
202
click to vote
ICASSP
2008
IEEE
16 years 2 months ago
2008
IEEE
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
210
click to vote
ISCC
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
215
click to vote
GLVLSI
2005
IEEE
16 years 1 months ago
2005
IEEE
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
189
click to vote
ISCAS
2005
IEEE
16 years 1 months ago
2005
IEEE
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...