Sciweavers

948 search results - page 109 / 190
» What can we achieve by arbitrary announcements
Sort
View
TON
2010
90views more  TON 2010»
13 years 7 months ago
On burst transmission scheduling in mobile TV broadcast networks
—In mobile TV broadcast networks, the base station broadcasts TV channels in bursts such that mobile devices can receive a burst of traffic and then turn off their radio frequen...
Mohamed Hefeeda, Cheng-Hsin Hsu
COLT
2010
Springer
13 years 7 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
ACCV
2010
Springer
13 years 4 months ago
Towards Full 3D Helmholtz Stereovision Algorithms
Helmholtz stereovision methods are limited to binocular stereovision or depth maps reconstruction. In this paper, we extend these methods to recover the full 3D shape of the object...
Amaël Delaunoy, Emmanuel Prados, Peter N. Bel...
ICALP
2004
Springer
14 years 2 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
COMPGEOM
2005
ACM
13 years 11 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert