Sciweavers

672 search results - page 33 / 135
» On the Expressive Power of the Loop Language
Sort
View
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
16 years 4 months ago
On Query Algebras for Probabilistic Databases
This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far...
Christoph Koch
121
Voted
EACL
2003
ACL Anthology
15 years 6 months ago
Finite Structure Query: A Tool for Querying Syntactically Annotated Corpora
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
Stephan Kepser
ICS
2009
Tsinghua U.
15 years 11 months ago
High-performance regular expression scanning on the Cell/B.E. processor
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
Daniele Paolo Scarpazza, Gregory F. Russell
JMLC
2000
Springer
15 years 8 months ago
Explicit Namespaces
A namespace is a mapping from labels to values. Most programming languages support different forms of namespaces, such as records, dictionaries, objects, environments, packages and...
Franz Achermann, Oscar Nierstrasz
137
Voted
AMAST
2006
Springer
15 years 8 months ago
The Essence of Multitasking
This article demonstrates how a powerful and expressive ion from concurrency theory--monads of resumptions--plays a dual r^ole as a programming tool for concurrent applications. Th...
William L. Harrison