1404 search results - page 84 / 281 » Complexity of admissible rules |
TNN
2010
13 years 4 months ago
2010
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
SEMCO
2007
IEEE
14 years 4 months ago
2007
IEEE
Model-driven development depends on good initial models. Creating these models by hand is a challenging task, because of complex specification documents and change requests. We p...
TCS
2010
13 years 4 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
ACL
2006
13 years 11 months ago
2006
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
ACL
2009
13 years 8 months ago
2009
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...