686 search results - page 118 / 138 » Packing Cycles in Graphs |
126
click to vote
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
89
Voted
SSS
2005
Springer
15 years 6 months ago
2005
Springer
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
109
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
85
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
104
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...