Sciweavers

423 search results - page 18 / 85
» On Term Rewriting Systems Having a Rational Derivation
Sort
View
172
Voted
POPL
2005
ACM
15 years 10 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 1 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
BMCBI
2010
139views more  BMCBI 2010»
14 years 9 months ago
PoGO: Prediction of Gene Ontology terms for fungal proteins
Background: Automated protein function prediction methods are the only practical approach for assigning functions to genes obtained from model organisms. Many of the previously re...
Jaehee Jung, Gangman Yi, Serenella A. Sukno, Micha...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
15 years 1 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
ANCS
2007
ACM
15 years 1 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos