Sciweavers

260 search results - page 2 / 52
» Range and Set Abstraction using SAT
Sort
View
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 9 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
ICTAI
2008
IEEE
14 years 3 hour ago
Haplotype Inference with Boolean Constraint Solving: An Overview
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
Inês Lynce, Ana Graça, João Ma...
ACTA
2007
92views more  ACTA 2007»
13 years 5 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
TIP
2008
199views more  TIP 2008»
13 years 5 months ago
Minimal-Bracketing Sets for High-Dynamic-Range Image Capture
Abstract--This paper considers the problem of high-dynamicrange (HDR) image capture using low-dynamic-range (LDR) cameras. We present three different minimal-bracketing algorithms ...
Neil Barakat, A. Nicholas Hone, Thomas E. Darcie
ECCV
2008
Springer
14 years 7 months ago
Scale-Dependent/Invariant Local 3D Shape Descriptors for Fully Automatic Registration of Multiple Sets of Range Images
Abstract. Despite the ubiquitous use of range images in various computer vision applications, little has been investigated about the size variation of the local geometric structure...
John Novatnack, Ko Nishino