Sciweavers

CSR
2006
Springer
14 years 3 months ago
Dynamic Isoline Extraction for Visualization of Streaming Data
Abstract. Queries over streaming data offer the potential to provide timely information for modern database applications, such as sensor networks and web services. Isoline-based vi...
Dina Q. Goldin, Huayan Gao
CSR
2006
Springer
14 years 3 months ago
Incremental Branching Programs
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
Anna Gál, Michal Koucký, Pierre McKe...
CSR
2006
Springer
14 years 3 months ago
Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
Patrick Cégielski, Irène Guessarian,...
CSR
2006
Springer
14 years 3 months ago
The Complexity of Equality Constraint Languages
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
Manuel Bodirsky, Jan Kára
CSR
2006
Springer
14 years 3 months ago
Planar Dimer Tilings
Olivier Bodini, Thomas Fernique
CSR
2006
Springer
14 years 3 months ago
Constructive Equivalence Relations on Computable Probability Measures
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
Laurent Bienvenu
CSR
2006
Springer
14 years 3 months ago
Conjugacy and Equivalence of Weighted Automata and Functional Transducers
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
Marie-Pierre Béal, Sylvain Lombardy, Jacque...
CSR
2006
Springer
14 years 3 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin