Sciweavers

4008 search results - page 95 / 802
» An expressive language of signatures
Sort
View
JOLLI
2010
94views more  JOLLI 2010»
15 years 4 months ago
Querying Linguistic Trees
Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic ...
Catherine Lai, Steven Bird
CP
2004
Springer
15 years 11 months ago
Deriving Filtering Algorithms from Constraint Checkers
Abstract. This article deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in n, w...
Nicolas Beldiceanu, Mats Carlsson, Thierry Petit
NAR
1998
101views more  NAR 1998»
15 years 6 months ago
The PRINTS protein fingerprint database in its fifth year
PRINTS is a database of protein family ‘fingerprints’ offering a diagnostic resource for newly-determined sequences. By contrast with PROSITE, which uses single consensus expr...
Terri K. Attwood, Michael E. Beck, Darren R. Flowe...
DEXAW
2009
IEEE
114views Database» more  DEXAW 2009»
15 years 10 months ago
A Meta-Framework for Generating Ontologies from Legacy Schemas
A huge amount of schemas are expressed within outdated schema languages which are restricted concerning expressiveness, extensibility, readability, and understandability. Consequen...
Manuel Wimmer
IMSCCS
2006
IEEE
16 years 10 days ago
Explicitly Parallel Regular Expressions
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
Brett D. Estrade, A. Louise Perkins, John M. Harri...