1094 search results - page 68 / 219 » On Computing Explanations in Argumentation |
GREC
2003
Springer
15 years 4 months ago
2003
Springer
We present a structural analysis method for the recognition of on-line handwritten mathematical expressions based on a minimum spanning tree construction and symbol dominance. The ...
89
Voted
COCO
1999
Springer
15 years 3 months ago
1999
Springer
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
COCO
1989
Springer
15 years 3 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
AE
2001
Springer
15 years 3 months ago
2001
Springer
This is a time of increasing interdisciplinary research. Computer science is learning more from biology every day, enabling a plethora of new software techniques to flourish. And b...
ICS
2010
Tsinghua U.
15 years 8 months ago
2010
Tsinghua U.
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...