Sciweavers

2723 search results - page 9 / 545
» Learning lexicographic orders
Sort
View
CADE
2007
Springer
14 years 7 months ago
Predictive Labeling with Dependency Pairs Using SAT
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
Adam Koprowski, Aart Middeldorp
ESOP
2004
Springer
14 years 23 days ago
From Constraints to Finite Automata to Filtering Algorithms
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
Mats Carlsson, Nicolas Beldiceanu
COCOON
2009
Springer
13 years 10 months ago
Three New Algorithms for Regular Language Enumeration
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
Margareta Ackerman, Erkki Mäkinen
TCS
2008
13 years 7 months ago
A characterization of fine words over a finite alphabet
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
Amy Glen
MEDINFO
2007
169views Healthcare» more  MEDINFO 2007»
13 years 8 months ago
Corpus-based Error Detection in a Multilingual Medical Thesaurus
Cross-language document retrieval systems require support by some kind of multilingual thesaurus for semantically indexing documents in different languages. The peculiarities of t...
Roosewelt L. Andrade, Edson José Pacheco, P...