Sciweavers

882 search results - page 174 / 177
» On the Hardness of Graph Isomorphism
Sort
View
SIGCOMM
2010
ACM
13 years 7 months ago
An analysis of social network-based Sybil defenses
Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity, or Sybil, attacks. A number of schemes have been propo...
Bimal Viswanath, Ansley Post, P. Krishna Gummadi, ...
SPAA
2010
ACM
13 years 7 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
AI
2010
Springer
13 years 7 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
AI
2007
Springer
13 years 7 months ago
Computational properties of argument systems satisfying graph-theoretic constraints
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
Paul E. Dunne
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot