Sciweavers

877 search results - page 8 / 176
» How to Cover a Grammar
Sort
View
ECEASST
2006
95views more  ECEASST 2006»
13 years 7 months ago
Towards Translating Graph Transformation Approaches by Model Transformations
Abstract. Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars writ...
Frank Hermann, Harmen Kastenberg, Tony Modica
SPAA
2010
ACM
14 years 5 days ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
COR
2006
122views more  COR 2006»
13 years 7 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
COLING
1990
13 years 8 months ago
A Phrase Structure Grammar Of The Arabic Language
A lot of work has been done in the field of natural language processing (NLP) for ARABIC. Few researchers have tried hard to apply on ARABIC the methods of computational linguisti...
Ayman Elnaggar
ACL
2001
13 years 8 months ago
Tractability and Structural Closures in Attribute Logic Type Signatures
This paper considers three assumptions conventionally made about signatures in typed feature logic that are in potential disagreement with current practice among grammar developer...
Gerald Penn