1094 search results - page 126 / 219 » On Computing Explanations in Argumentation |
CGI
2001
IEEE
15 years 2 months ago
2001
IEEE
This paper presents ways of approaching the design of successful character-based interactive installations. We rationalize our arguments within the context of both Disney's &...
CIE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
106
click to vote
COMPGEOM
2008
ACM
15 years 27 days ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
EMNLP
2008
15 years 17 days ago
2008
We address the task of computing vector space representations for the meaning of word occurrences, which can vary widely according to context. This task is a crucial step towards ...
ESANN
2004
15 years 15 days ago
2004
The way information is represented and processed in a neural network may have important consequences on its computational power and complexity. Basically, information representatio...