1220 search results - page 77 / 244 » Restricting grammatical complexity |
CAV
2008
Springer
13 years 9 months ago
2008
Springer
This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexi...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
ESANN
2008
13 years 9 months ago
2008
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
SE
2007
13 years 9 months ago
2007
Abstract: Software development is a complex task and therefore requires professional programming skills. Restricting the focus to a specific problem domain allows the application o...
NAACL
2003
13 years 9 months ago
2003
We present improvements to a greedy decoding algorithm for statistical machine translation that reduce its time complexity from at least cubic ( ¢¡¤£¦¥¨§ when applied na...