Sciweavers

1000 search results - page 200 / 200
» Nominal rewriting systems
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 8 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
PASTE
2010
ACM
13 years 6 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
CERA
2002
134views more  CERA 2002»
13 years 4 months ago
Graph Grammar Based Product Family Modeling
: Many industries are shifting from mass production to mass customization, which demands quick response to the needs of individual customers with high quality and low costs. The de...
Xuehong Du, Jianxin Jiao, Mitchell M. Tseng
SIAMSC
2010
140views more  SIAMSC 2010»
13 years 3 months ago
Parallel High-Order Integrators
In this work we discuss a class of defect correction methods which is easily adapted to create parallel time integrators for multi-core architectures and is ideally suited for deve...
Andrew J. Christlieb, Colin B. Macdonald, Benjamin...
ECEASST
2006
103views more  ECEASST 2006»
13 years 4 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco