699 search results - page 108 / 140 » Generalized Distance Functions in the Theory of Computation |
WWW
2009
ACM
15 years 10 months ago
2009
ACM
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vick...
103
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
115
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...