141 search results - page 22 / 29 » An Algorithm for Transformation of Finite Automata to Regula... |
DLT
2006
13 years 10 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
SAS
2001
Springer
14 years 1 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
LATA
2009
Springer
14 years 3 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
In this paper, we present a robust face alignment system that is capable of dealing with exaggerating expressions, large occlusions, and a wide variety of image noises. The robustn...
ESOP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper concerns mechanisms for maintaining the value of an instrumentation predicate (a.k.a. derived predicate or view), defined via a logical formula over core pred...