Sciweavers

220 search results - page 14 / 44
» Linear-Time Hierarchies for a Functional Language Machine Mo...
Sort
View
PARLE
1992
13 years 11 months ago
Characterizing the Paralation Model using Dynamic Assignment
Collection-oriented languages provide high-level constructs for describing computations over collections. These languages are becoming increasingly popular with the advent of massi...
Eric T. Freeman, Daniel P. Friedman
WCRE
2003
IEEE
14 years 19 days ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
FSS
2008
127views more  FSS 2008»
13 years 7 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...
BMCBI
2010
109views more  BMCBI 2010»
13 years 7 months ago
Predicting gene function using hierarchical multi-label decision tree ensembles
Background: S. cerevisiae, A. thaliana and M. musculus are well-studied organisms in biology and the sequencing of their genomes was completed many years ago. It is still a challe...
Leander Schietgat, Celine Vens, Jan Struyf, Hendri...
EMNLP
2009
13 years 5 months ago
Consensus Training for Consensus Decoding in Machine Translation
We propose a novel objective function for discriminatively tuning log-linear machine translation models. Our objective explicitly optimizes the BLEU score of expected n-gram count...
Adam Pauls, John DeNero, Dan Klein