34 search results - page 2 / 7 » On implementing recognizable transductions |
FCT
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
DLT
2006
13 years 6 months ago
2006
By weakly ambiguous (finite) transducers we mean those transducers that, although being ambiguous, may be viewed to be at arm's length from unambiguity. We define input-unambi...
FOSSACS
2000
Springer
13 years 9 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
ICARCV
2008
IEEE
13 years 11 months ago
2008
IEEE
—Face recognition performance depends upon the input variability as encountered during biometric data capture including occlusion and disguise. The challenge met in this paper is...
MMM
2007
Springer
13 years 11 months ago
2007
Springer
Domain-specific knowledge of paintings defines a wide range of concepts for annotation and flexible retrieval of paintings. In this work, we employ the ontology of artistic concept...