Sciweavers

2040 search results - page 384 / 408
» On the Complexity of Error Explanation
Sort
View
108
Voted
DBPL
1999
Springer
102views Database» more  DBPL 1999»
15 years 6 months ago
Union Types for Semistructured Data
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
Peter Buneman, Benjamin C. Pierce
EPIA
1999
Springer
15 years 6 months ago
Improving Optical Music Recognition by Means of Abductive Constraint Logic Programming
In this paper we propose a hybrid system that bridges the gap between traditional image processing methods, used for low-level object recognition, and abductive constraint logic pr...
Miguel Ferrand, João Alexandre Leite, Am&ia...
RTCSA
1999
IEEE
15 years 6 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
IH
1999
Springer
15 years 6 months ago
Hiding Signatures in Graph Coloring Solutions
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
Gang Qu, Miodrag Potkonjak
111
Voted
RTSS
1998
IEEE
15 years 6 months ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan