1094 search results - page 157 / 219 » On Computing Explanations in Argumentation |
COCO
2009
Springer
14 years 4 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
CONCUR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
This article presents the evaluation of a valence dictionary for Polish produced with the help of shallow parsing techniques and compares those results to earlier results involving...
CVPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Shape database search is ubiquitous in the world of biometric systems, CAD systems etc. Shape data in these domains is experiencing an explosive growth and usually requires search...
TOPLAS
2008
13 years 10 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...