Sciweavers

3724 search results - page 114 / 745
» Timed regular expressions
Sort
View
SBBD
2007
179views Database» more  SBBD 2007»
15 years 5 months ago
Assisting XML Schema Evolution that Preserves Validity
Abstract. We consider the problem of XML schema evolution preserving the validity of existing documents related to the original schema. The aim of such schema evolution is to fit ...
Béatrice Bouchou, Denio Duarte
TIT
2002
120views more  TIT 2002»
15 years 3 months ago
Finite-length analysis of low-density parity-check codes on the binary erasure channel
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expr...
Changyan Di, David Proietti, Ì. Emre Telata...
ECRTS
2002
IEEE
15 years 9 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
LICS
2010
IEEE
15 years 2 months ago
The Expressive Power of Synchronizations
A synchronization is a mechanism allowing two or more processes to perform actions at the same time. We study the expressive power of synchronizations gathering more and more proc...
Cosimo Laneve, Antonio Vitale
FOCS
2008
IEEE
15 years 10 months ago
Hardness of Minimizing and Learning DNF Expressions
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
Subhash Khot, Rishi Saket