432 search results - page 50 / 87 » On Notions of Regularity for Data Languages |
ICDT
2003
ACM
14 years 27 days ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
LCR
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...
NAACL
2010
13 years 5 months ago
2010
In this paper we propose a novel general framework for unsupervised model adaptation. Our method is based on entropy which has been used previously as a regularizer in semi-superv...
CONCUR
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
EMSOFT
2005
Springer
14 years 1 months ago
2005
Springer
We propose a programming model dedicated to real-time videostreaming applications for embedded media devices, including highdefinition TVs. This model is built on the synchronous...