1094 search results - page 202 / 219 » On Computing Explanations in Argumentation |
105
Voted
FOCS
2007
IEEE
15 years 4 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...
125
click to vote
AI50
2006
15 years 4 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
15 years 15 days 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...
96
Voted
CVPR
2008
IEEE
16 years 2 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...
122
Voted
ESORICS
2009
Springer
16 years 1 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...