Sciweavers

612 search results - page 61 / 123
» A Computational Grammar for Georgian
Sort
View
CLEIEJ
2006
97views more  CLEIEJ 2006»
15 years 1 months ago
Prediction of RNA Pseudoknotted Secondary Structure using Stochastic Context Free Grammars (SCFG)
Pseudoknots are a frequent RNA structure that assumes essential roles for varied biocatalyst cell's functions. One of the most challenging fields in bioinformatics is the pre...
Rafael Garcia
RAID
2009
Springer
15 years 8 months ago
Using Formal Grammar and Genetic Operators to Evolve Malware
In this paper, we leverage the concepts of formal grammar and genetic operators to evolve malware. As a case study, we take COM infectors and design their formal grammar with produ...
Sadia Noreen, Shafaq Murtaza, M. Zubair Shafiq, Mu...
ECOOP
2004
Springer
15 years 6 months ago
Rewritable Reference Attributed Grammars
This paper presents an object-oriented technique for rewriting abstract syntax trees in order to simplify compilation. The technique, Rewritable Reference Attributed Grammars (ReRA...
Torbjörn Ekman, Görel Hedin
ACL
2007
15 years 2 months ago
Optimizing Grammars for Minimum Dependency Length
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
Daniel Gildea, David Temperley
STACS
2004
Springer
15 years 6 months ago
Active Context-Free Games
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
Anca Muscholl, Thomas Schwentick, Luc Segoufin