Sciweavers

7006 search results - page 934 / 1402
» Approximation Algorithms
Sort
View
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
15 years 7 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
ISVC
2009
Springer
16 years 2 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
COMSWARE
2007
IEEE
15 years 11 months ago
On Configuring BGP Route Reflectors
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within a...
Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta...
JACM
2006
99views more  JACM 2006»
15 years 7 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 10 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown