Sciweavers

10435 search results - page 372 / 2087
» Computational Biology and Language
Sort
View
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
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...
Olaf Chitil
SCCC
2008
IEEE
16 years 1 months ago
A Domain Specific Language for the Development of Collaborative Systems
Domain-Specific Languages (DSLs) are high level languages defined for combining expressivity and simplicity by means of constructs which are close to the problem domain and distan...
Luis Mariano Bibbo, Diego García, Claudia P...
SEMCO
2007
IEEE
16 years 1 months ago
Multimedia Reasoning with Natural Language Support
In this paper we present an approach that combines multimedia reasoning and natural language processing for the semantic integration of automatic and manual image annotations base...
Stamatia Dasiopoulou, Johannes Heinecke, Carsten S...
BIRTHDAY
2001
Springer
15 years 11 months ago
Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars
A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) is a kind of generative grammar, where parsing can be performed without backtracking. In this paper, we invest...
Jia Lee, Kenichi Morita
154
Voted
FCT
2001
Springer
15 years 11 months ago
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular ...
Kouichi Hirata, Hiroshi Sakamoto