Sciweavers

1242 search results - page 40 / 249
» The Theory of Grammar Constraints
Sort
View
COLING
1996
15 years 3 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
CERA
2002
134views more  CERA 2002»
15 years 1 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
UML
2001
Springer
15 years 6 months ago
Representing Embedded System Sequence Diagrams as a Formal Language
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
Elizabeth Latronico, Philip Koopman
CSDA
2006
72views more  CSDA 2006»
15 years 2 months ago
Generalized theory of uncertainty (GTU) - principal concepts and ideas
Uncertainty is an attribute of information. The path-breaking work of Shannon has led to a universal acceptance of the thesis that information is statistical in nature. Concomitan...
Lotfi A. Zadeh