Sciweavers

2040 search results - page 22 / 408
» On the Complexity of Error Explanation
Sort
View
AI
2008
Springer
13 years 7 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
EUROCRYPT
2004
Springer
14 years 1 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
ICASSP
2008
IEEE
14 years 2 months ago
Computationally efficient equalization of room impulse responses robust to system estimation errors
Equalization techniques for room impulse responses (RIRs) are important in acoustic signal processing applications such as speech dereverberation. In practice, only approximate es...
Wancheng Zhang, Nikolay D. Gaubitch, Patrick A. Na...
ECAI
2004
Springer
14 years 1 months ago
Explaining the Result of a Decision Tree to the End-User
This paper addresses the problem of the explanation of the result given by a decision tree, when it is used to predict the class of new cases. In order to evaluate this result, the...
Isabelle Alvarez
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
Investigating the Potential of Test-Driven Development for Spreadsheet Engineering
It is widely documented that the absence of a structured approach to spreadsheet engineering is a key factor in the high level of spreadsheet errors. In this paper we propose and ...
Alan Rust, Brian Bishop, Kevin McDaid