Sciweavers

1763 search results - page 142 / 353
» A Formalization of Polytime Functions
Sort
View
ACL2
2006
ACM
15 years 4 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
ICDAR
2005
IEEE
15 years 3 months ago
The Recognition Strategy Language
The table recognition literature contains many strategies specified informally as a sequence of operations, obscuring both models of table structure and the effects of individual...
Richard Zanibbi, Dorothea Blostein, James R. Cordy
DSOM
2005
Springer
15 years 3 months ago
Ontology-Based Integration of Management Behaviour and Information Definitions Using SWRL and OWL
Current network management architectures are using different models to define management information objects. These definitions actually also include, in a non-formal way, the defi...
Antonio Guerrero, Víctor A. Villagrá...
ECCV
2004
Springer
15 years 3 months ago
A Fourier Theory for Cast Shadows
—Cast shadows can be significant in many computer vision applications, such as lighting-insensitive recognition and surface reconstruction. Nevertheless, most algorithms neglect ...
Ravi Ramamoorthi, Melissa L. Koudelka, Peter N. Be...
CPAIOR
2010
Springer
15 years 2 months ago
Constraint Reasoning with Uncertain Data Using CDF-Intervals
Interval coefficients have been introduced in OR and CP to specify uncertain data in order to provide reliable solutions to convex models. The output is generally a solution set, ...
Aya Saad, Carmen Gervet, Slim Abdennadher