Sciweavers

417 search results - page 31 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
ATAL
2007
Springer
14 years 3 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
JAIR
2006
89views more  JAIR 2006»
13 years 9 months ago
Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
Philippe Adjiman, Philippe Chatalic, Franço...
ATAL
2006
Springer
14 years 22 days ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 3 months ago
On the comparison of microdata disclosure control algorithms
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
NIPS
2008
13 years 10 months ago
Breaking Audio CAPTCHAs
CAPTCHAs are computer-generated tests that humans can pass but current computer systems cannot. CAPTCHAs provide a method for automatically distinguishing a human from a computer ...
Jennifer Tam, Jirí Simsa, Sean Hyde, Luis v...