Sciweavers

205 search results - page 4 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
ATAL
2008
Springer
13 years 10 months ago
Norm emergence under constrained interactions in diverse societies
Effective norms, emerging from sustained individual interactions over time, can complement societal rules and significantly enhance performance of individual agents and agent soci...
Partha Mukherjee, Sandip Sen, Stéphane Airi...
FSTTCS
2001
Springer
14 years 1 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
LCN
2007
IEEE
14 years 2 months ago
A Game-Theoretic Framework for Bandwidth Attacks and Statistical Defenses
Abstract—We introduce a game-theoretic framework for reasoning about bandwidth attacks, a common form of distributed denial of service (DDoS) attacks. In particular, our traffic...
Mark E. Snyder, Ravi Sundaram, Mayur Thakur
ICASSP
2011
IEEE
13 years 8 days ago
Exploiting active-learning strategies for annotating prosodic events with limited labeled data
Many applications of spoken-language systems can benefit from having access to annotations of prosodic events. Unfortunately, obtaining human annotations of these events, even se...
Raul Fernandez, Bhuvana Ramabhadran
INFOCOM
2009
IEEE
14 years 3 months ago
Null Keys: Limiting Malicious Attacks Via Null Space Properties of Network Coding
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
Elias Kehdi, Baochun Li