Sciweavers

113 search results - page 14 / 23
» Solving Boolean Equations Using ROSOP Forms
Sort
View
79
Voted
STACS
2004
Springer
15 years 3 months ago
Algorithms for SAT Based on Search in Hamming Balls
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolper...
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
15 years 3 months ago
Leveraging dominators for preprocessing QBF
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva,...
SC
1995
ACM
15 years 1 months ago
Parallel Matrix-Vector Product Using Approximate Hierarchical Methods
Matrix-vector products (mat-vecs) form the core of iterative methods used for solving dense linear systems. Often, these systems arise in the solution of integral equations used i...
Ananth Grama, Vipin Kumar, Ahmed H. Sameh

Publication
1500views
16 years 11 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected aut...
M. Sabry Hassouna, Aly A. Farag

Presentation
3660views
16 years 11 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
M. Sabry Hassouna