Sciweavers

91 search results - page 12 / 19
» Regular Expressions for Languages over Infinite Alphabets
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
14 years 7 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...
ITA
2006
13 years 7 months ago
Probabilistic models for pattern statistics
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
Massimiliano Goldwurm, Roberto Radicioni
SAC
2008
ACM
13 years 7 months ago
Aggregation languages for moving object and places of interest
We address aggregate queries over GIS data and moving object data, where non-spatial information is stored in a data warehouse. We propose a formal data model and query language t...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...
ENTCS
2008
120views more  ENTCS 2008»
13 years 7 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier