3653 search results - page 119 / 731 » On Recognizable Timed Languages |
IFL
1997
Springer
15 years 2 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
ACL
1993
14 years 11 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
OOPSLA
2010
Springer
14 years 8 months ago
2010
Springer
As heterogeneous parallel systems become dominant, application developers are being forced to turn to an incompatible mix of low level programming models (e.g. OpenMP, MPI, CUDA, ...
VL
2010
IEEE
14 years 8 months ago
2010
IEEE
Visual programming languages can be used to make computer science more accessible to a broad range of students. The evaluative focus of current research in the area of visual lang...
118
click to vote
EMNLP
2010
14 years 8 months ago
2010
Using multi-layer neural networks to estimate the probabilities of word sequences is a promising research area in statistical language modeling, with applications in speech recogn...