Sciweavers

310 search results - page 56 / 62
» Cutting two graphs simultaneously
Sort
View
MOBIHOC
2007
ACM
14 years 9 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
CVPR
2010
IEEE
14 years 6 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 4 months ago
Distributed Link Scheduling for TDMA Mesh Networks
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
Petar Djukic, Shahrokh Valaee
QEST
2006
IEEE
14 years 4 months ago
Strategy Improvement for Concurrent Reachability Games
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
ICCV
2005
IEEE
14 years 3 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov