Sciweavers

3750 search results - page 166 / 750
» Timed Automata Patterns
Sort
View
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 6 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
TCS
2008
15 years 6 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
CIE
2007
Springer
16 years 19 days ago
From Logic to Physics: How the Meaning of Computation Changed over Time
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
Itamar Pitowsky
ICDM
2007
IEEE
96views Data Mining» more  ICDM 2007»
16 years 24 days ago
The Chosen Few: On Identifying Valuable Patterns
Constrained pattern mining extracts patterns based on their individual merit. Usually this results in far more patterns than a human expert or a machine learning technique could m...
Björn Bringmann, Albrecht Zimmermann
AWIC
2003
Springer
15 years 11 months ago
Formalization of Web Design Patterns Using Ontologies
Design patterns have been enthusiastically embraced in the software engineering community as well as in the web community since they capture knowledge about how and when to apply a...
Susana Montero, Paloma Díaz, Ignacio Aedo