Sciweavers

223 search results - page 31 / 45
» Information-based Case Grammar
Sort
View
143
Voted
ACL
1992
15 years 6 months ago
Recognition of Linear Context-Free Rewriting Systems
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
Giorgio Satta
146
Voted
TCS
2008
15 years 5 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
ECMDAFA
2008
Springer
166views Hardware» more  ECMDAFA 2008»
15 years 7 months ago
Towards Roundtrip Engineering - A Template-Based Reverse Engineering Approach
Model driven development suggests to make models the main artifact in software development. To get executable models in most cases code generation to a "traditional" prog...
Manuel Bork, Leif Geiger, Christian Schneider, Alb...
DAM
2008
90views more  DAM 2008»
15 years 5 months ago
Polarity of chordal graphs
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
Tinaz Ekim, Pavol Hell, Juraj Stacho, Dominique de...
GD
2004
Springer
15 years 11 months ago
Clustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...