Sciweavers

7121 search results - page 282 / 1425
» Functions as Session-Typed Processes
Sort
View
ARITH
2007
IEEE
15 years 10 months ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
ANLP
1994
70views more  ANLP 1994»
15 years 8 months ago
English Adverb Generation in Japanese to English Machine Translation
This paper proposes an English adverb ordering method based on adverb grammatical functions (subjuncts, adjuncts, disjuncts and conjuncts) and meanings (process, space, time etc.)...
Kentaro Ogura, Francis Bond, Satoru Ikehara
BIOINFORMATICS
2010
87views more  BIOINFORMATICS 2010»
15 years 6 months ago
Discriminatory power of RNA family models
Motivation: RNA family models group nucleotide sequences that share a common biological function. These models can be used to find new sequences belonging to the same family. To s...
Christian Höner zu Siederdissen, Ivo L. Hofac...
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 6 months ago
Realizing evaluation strategies by hierarchical graph rewriting
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into t...
Petra Hofstedt
JMIS
2010
70views more  JMIS 2010»
15 years 1 months ago
Bounded Ideation Theory
This paper presents Bounded Ideation Theory (BIT) to explain the relationship between the number-of-ideas and the number-of-good-ideas contributed during ideation. BIT posits that...
Robert O. Briggs, Bruce A. Reinig