Sciweavers

1996 search results - page 90 / 400
» A decision procedure for linear
Sort
View
SAT
2005
Springer
123views Hardware» more  SAT 2005»
15 years 11 months ago
Bounded Model Checking with QBF
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
Nachum Dershowitz, Ziyad Hanna, Jacob Katz
ISQED
2002
IEEE
175views Hardware» more  ISQED 2002»
15 years 11 months ago
On the Relation between SAT and BDDs for Equivalence Checking
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...
Sherief Reda, Rolf Drechsler, Alex Orailoglu
AGP
1999
IEEE
15 years 10 months ago
Freeness Analysis through Linear Refinement
Domains Decomposing Non-Redundant Sharing by Complementation . . . . . . . . . . . . . 69 Enea Zaffanella, Patricia M. Hill, Roberto Bagnara Freeness Analysis Through Linear Refine...
Patricia M. Hill, Fausto Spoto
MVA
1998
103views Computer Vision» more  MVA 1998»
15 years 7 months ago
A Comparison of Linear Processor Arrays for Image Processing
This paper describes a comparisonof the performance and usability of three Linear Processor Arrays for image processing purposes. The study covered the NEC IMAP-VISION card 1], th...
Matthijs van der Molen, Pieter Jonker
IJAIT
2006
121views more  IJAIT 2006»
15 years 6 months ago
An Efficient Feature Selection Algorithm for Computer-aided Polyp Detection
We present an efficient feature selection algorithm for computer aided detection (CAD) computed tomographic (CT) colonography. The algorithm 1) determines an appropriate piecewise...
Jiang Li, Jianhua Yao, Ronald M. Summers, Nicholas...