Sciweavers

83 search results - page 15 / 17
» An Algorithm for Generating Arguments in Classical Predicate...
Sort
View
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
12 years 10 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
ISMVL
2007
IEEE
92views Hardware» more  ISMVL 2007»
14 years 18 days ago
Experimental Studies on SAT-Based ATPG for Gate Delay Faults
The clock rate of modern chips is still increasing and at the same time the gate size decreases. As a result, already slight variations during the production process may cause a f...
Stephan Eggersglüß, Daniel Tille, G&oum...
ATAL
2010
Springer
13 years 7 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
JAIR
2006
179views more  JAIR 2006»
13 years 6 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
ICFEM
2009
Springer
13 years 4 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...