Sciweavers

9 search results - page 2 / 2
» Efficient Algorithms for Constant Well Supported Approximate...
Sort
View
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
INFOCOM
2010
IEEE
13 years 3 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
ECCV
2008
Springer
14 years 7 months ago
Online Sparse Matrix Gaussian Process Regression and Vision Applications
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
Ananth Ranganathan, Ming-Hsuan Yang