In this paper, we present a computational method for transforming a syntactic graph, which represents all syntactic interpretations of a sentence, into a semantic graph which filt...
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
Background: We establish that the occurrence of protein folds among genomes can be accurately described with a Weibull function. Systems which exhibit Weibull character can be int...
Artem Cherkasov, Shannan J. Ho Sui, Robert C. Brun...
Recent adaptive image interpretation systems can reach optimal performance for a given domain via machine learning, without human intervention. The policies are learned over an ex...
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...