Sciweavers

3319 search results - page 580 / 664
» Subshifts, Languages and Logic
Sort
View
148
Voted
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 4 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
101
Voted
PASTE
2010
ACM
15 years 2 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
99
Voted
DEBS
2008
ACM
15 years 2 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
113
Voted
ODRL
2004
15 years 2 months ago
Nonius: Implementing a DRM Extension to an XML Browser
The paper describes experiences, ideas, and problems that were discovered while developing a digital rights management (DRM) extension to an XML browser. The supported rights desc...
Olli Pitkänen, Ville Saarinen, Jari Anttila, ...
SCP
2010
155views more  SCP 2010»
14 years 11 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay