Sciweavers

874 search results - page 161 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
SAT
2005
Springer
129views Hardware» more  SAT 2005»
14 years 2 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
PE
2010
Springer
102views Optimization» more  PE 2010»
13 years 7 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
CVPR
2010
IEEE
14 years 4 months ago
Parametric Dimensionality Reduction by Unsupervised Regression
We introduce a parametric version (pDRUR) of the recently proposed Dimensionality Reduction by Unsupervised Regression algorithm. pDRUR alternately minimizes reconstruction error ...
Miguel Carreira-perpinan, Zhengdong Lu
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
15 years 4 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
IPMI
2005
Springer
14 years 9 months ago
Spherical Navigator Registration Using Harmonic Analysis for Prospective Motion Correction
Spherical navigators are an attractive approach to motion compensation in Magnetic Resonance Imaging. Because they can be acquired quickly, spherical navigators have the potential ...
Christopher L. Wyatt, Narter Ari, Robert A. Kraft