1094 search results - page 202 / 219 » On Computing Explanations in Argumentation |
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
AI50
2006
14 years 1 months ago
2006
I analyze some of the attacks against the Physical Symbol System Hypothesis--attacks based on the presumed need for symbolgrounding and non-symbolic processing for intelligent beha...
ECCC
2006
13 years 10 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
CVPR
2008
IEEE
14 years 12 months ago
2008
IEEE
Studies support the need for high resolution imagery to identify persons in surveillance videos[13]. However, the use of telephoto lenses sacrifices a wider field of view and ther...
ESORICS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...