Sciweavers

2944 search results - page 51 / 589
» Improving Bound Propagation
Sort
View
ASPDAC
2012
ACM
265views Hardware» more  ASPDAC 2012»
13 years 7 months ago
Improving validation coverage metrics to account for limited observability
—In both pre-silicon and post-silicon validation, the detection of design errors requires both stimulus capable of activating the errors and checkers capable of detecting the beh...
Peter Lisherness, Kwang-Ting Cheng
ICCV
2001
IEEE
16 years 1 months ago
Propagation of Innovative Information in Non-Linear Least-Squares Structure from Motion
We present a new technique that improves upon existing structure from motion (SFM) methods. We propose a SFM algorithm that is both recursive and optimal. Our method incorporates ...
Drew Steedly, Irfan A. Essa
TIT
2008
129views more  TIT 2008»
14 years 11 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
VTC
2007
IEEE
15 years 6 months ago
Rake Receiver Improvement for Residual Interference Cancellation in UWB Context
Abstract—In the context of PAM Time-Hopping/Direct Sequence Impulse Radio Ultra Wide Band (IR-UWB), a residual interference occurs at the output of the Rake Receiver when realist...
Anne-Laure Deleuze, Christophe Le Martret, Philipp...
CONSTRAINTS
1998
94views more  CONSTRAINTS 1998»
14 years 11 months ago
Resource Constraints for Preemptive Job-shop Scheduling
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
Claude Le Pape, Philippe Baptiste