Sciweavers

146 search results - page 16 / 30
» Rewriting of Regular Expressions and Regular Path Queries
Sort
View
FSTTCS
2010
Springer
14 years 7 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
ACL
1996
14 years 11 months ago
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
Richard Sproat, Michael Riley
ODBIS
2007
Springer
157views Database» more  ODBIS 2007»
15 years 3 months ago
An Extension of SPARQL for RDFS
Abstract. RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet...
Marcelo Arenas, Claudio Gutierrez, Jorge Pé...
APBC
2004
154views Bioinformatics» more  APBC 2004»
14 years 11 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu
PKDD
2000
Springer
125views Data Mining» more  PKDD 2000»
15 years 1 months ago
Materialized Data Mining Views
Data mining is a useful decision support technique, which can be used to find trends and regularities in warehouses of corporate data. A serious problem of its practical applicatio...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...