1724 search results - page 52 / 345 » Abstract Interpreters for Free |
199
Voted
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
154
Voted
FPCA
1995
15 years 9 months ago
1995
Models of Memory Management Greg Morrisett Matthias Felleisen Robert Harper January 1995 CMU{CS{95{110 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Al...
140
click to vote
AAAI
2004
15 years 6 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
160
click to vote
MICCAI
2003
Springer
16 years 6 months ago
2003
Springer
This paper describes shape analysis of the caudate nucleus structure in a large schizophrenia study (30 controls, 60 schizophrenics). Although analysis of the caudate has not drawn...
166
Voted
CONCUR
2009
Springer
15 years 12 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...