1094 search results - page 161 / 219 » On Computing Explanations in Argumentation |
STOC
2004
ACM
14 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
CHI
2006
ACM
14 years 3 months ago
2006
ACM
This study examines the roles of gender and visual realism in the persuasiveness of speakers. Participants were presented with a persuasive passage delivered by a male or female p...
FCT
2005
Springer
14 years 3 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
— Recent investigations into the pricing of multiclass loss networks have shown that static prices are optimal in the asymptotic regime of many small sources. These results sugge...
PERCOM
2003
ACM
14 years 3 months ago
2003
ACM
To programmatically discover and interact with services in ubiquitous computing environments, an application needs to solve two problems: (1) is it semantically meaningful to inte...