Sciweavers

672 search results - page 78 / 135
» On the Expressive Power of the Loop Language
Sort
View
ICADL
2005
Springer
114views Education» more  ICADL 2005»
15 years 11 months ago
Scalability of Databases for Digital Libraries
Search engines of main-stream literature digital libraries such as ACM Digital Library, Google Scholar, and PubMed employ file-based systems, and provide users with a basic boolean...
John Chmura, Nattakarn Ratprasartporn, Gultekin &O...
EELC
2006
124views Languages» more  EELC 2006»
15 years 9 months ago
How Grammar Emerges to Dampen Combinatorial Search in Parsing
Abstract. According to the functional approach to language evolution (inspired by cognitive linguistics and construction grammar), grammar arises to deal with issues in communicati...
Luc Steels, Pieter Wellens
ICFP
2004
ACM
16 years 6 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester
CONCUR
2009
Springer
16 years 21 days ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 9 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu