Sciweavers

619 search results - page 77 / 124
» Random Bichromatic Matchings
Sort
View
CORR
2008
Springer
64views Education» more  CORR 2008»
13 years 9 months ago
Linearly Parameterized Bandits
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
Paat Rusmevichientong, John N. Tsitsiklis
PAMI
2007
176views more  PAMI 2007»
13 years 8 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
MOR
2010
118views more  MOR 2010»
13 years 7 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
TCOM
2010
167views more  TCOM 2010»
13 years 7 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
ICIP
2010
IEEE
13 years 6 months ago
An automated vertebra identification and segmentation in CT images
In this paper, we propose a new 3D framework to identify and segment VBs and TBs in clinical computed tomography (CT) images without any user intervention. The Matched filter is e...
Melih S. Aslan, Asem M. Ali, Ham Rara, Aly A. Fara...