Sciweavers

5904 search results - page 618 / 1181
» Requirements for a Composition Language
Sort
View
PASTE
2010
ACM
15 years 9 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
BMCBI
2006
116views more  BMCBI 2006»
15 years 7 months ago
HotSwap for bioinformatics: A STRAP tutorial
Background: Bioinformatics applications are now routinely used to analyze large amounts of data. Application development often requires many cycles of optimization, compiling, and...
Christoph Gille, Peter N. Robinson
TSE
1998
176views more  TSE 1998»
15 years 7 months ago
Constructive Protocol Specification Using Cicero
—New protocols are often useful, but are hard to implement well. Protocol synthesis is a solution, but synthesized protocols can be slow. Implementing protocols will be even more...
Yen-Min Huang, Chinya V. Ravishankar
KES
2007
Springer
16 years 1 months ago
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
Nicola Fanizzi, Claudia d'Amato
DOCENG
2004
ACM
16 years 27 days ago
Techniques for authoring complex XML documents
This paper reviews the main innovations of XML and considers their impact on the editing techniques for structured documents. Namespaces open the way to compound documents; well-f...
Vincent Quint, Irène Vatton