Sciweavers

5153 search results - page 475 / 1031
» Introduction to Randomized Algorithms
Sort
View
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
16 years 12 days ago
Decentralized Load Balancing for Highly Irregular Search Problems
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....
Giuseppe Di Fatta, Michael R. Berthold
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
15 years 12 months ago
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
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...
Vishal Suthar, Shantanu Dutt
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 12 months ago
One-pass computation-aware motion estimation with adaptive search strategy
— 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...
Yu-Wen Huang, Chia-Lin Lee, Ching-Yeh Chen, Liang-...
ECCV
2010
Springer
15 years 11 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
15 years 10 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann