Sciweavers

274 search results - page 32 / 55
» Identifying sets of key players in a social network
Sort
View
MOBIHOC
2009
ACM
14 years 11 months ago
Efficient uncoordinated FHSS anti-jamming communication
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
Mario Strasser, Christina Pöpper, Srdjan Capk...
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 11 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
ACMDIS
2006
ACM
14 years 4 months ago
Supporting ethnographic studies of ubiquitous computing in the wild
Ethnography has become a staple feature of IT research over the last twenty years, shaping our understanding of the social character of computing systems and informing their desig...
Andy Crabtree, Steve Benford, Chris Greenhalgh, Pa...
NETGAMES
2003
ACM
14 years 4 months ago
Spatial principles of level-design in multi-player first-person shooters
: This paper outlines the basic spatial principles of level design in multi-player first-person shooters with special reference to Counterstrike, basing itself on experiment, analy...
Christian Güttler, Troels Degn Johansson
CDC
2010
IEEE
104views Control Systems» more  CDC 2010»
13 years 5 months ago
Single timescale regularized stochastic approximation schemes for monotone Nash games under uncertainty
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...
Jayash Koshal, Angelia Nedic, Uday V. Shanbhag