Sciweavers

481 search results - page 33 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
GLOBECOM
2010
IEEE
13 years 6 months ago
Multicast Advance Reservation RWA Heuristics in Wavelength-Routed Networks
In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Advance reservation connection requests specify ...
Neal Charbonneau, Vinod Vokkarane
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
13 years 8 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 3 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
ECCC
2010
87views more  ECCC 2010»
13 years 6 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 8 months ago
The source coding game with a cheating switcher
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
Hari Palaiyanur, Cheng Chang, Anant Sahai