432 search results - page 13 / 87 » On Notions of Regularity for Data Languages |
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
FOSSACS
2000
Springer
13 years 11 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
DEBU
2007
13 years 7 months ago
2007
Modern database systems mostly support representation and retrieval of data belonging to different scripts and different languages. But the database functions are mostly designed ...
PPOPP
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...