1094 search results - page 206 / 219 » On Computing Explanations in Argumentation |
STOC
2009
ACM
14 years 10 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
ICS
2010
Tsinghua U.
14 years 7 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
CHI
2010
ACM
14 years 4 months ago
2010
ACM
The “wisdom of crowds” argument emphasizes the importance of diversity in online collaborations, such as open source projects and Wikipedia. However, decades of research on di...