Sciweavers

5012 search results - page 115 / 1003
» Distributed Error Correction
Sort
View
STACS
1999
Springer
15 years 9 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
151
Voted
HIPC
2000
Springer
15 years 8 months ago
Memory Consistency and Process Coordination for SPARC Multiprocessors
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
Lisa Higham, Jalal Kawash
ICML
2005
IEEE
16 years 5 months ago
Error bounds for correlation clustering
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
Thorsten Joachims, John E. Hopcroft
BPM
2000
Springer
133views Business» more  BPM 2000»
15 years 8 months ago
Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques
Workflow management systems facilitate the everyday operation of business processes by taking care of the logistic control of work. In contrast to traditional information systems, ...
Wil M. P. van der Aalst
VMCAI
2005
Springer
15 years 10 months ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan