3211 search results - page 212 / 643 » On the Grundy Number of a Graph |
165
click to vote
TPDS
2008
15 years 6 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
217
click to vote
GLOBECOM
2010
IEEE
15 years 3 months ago
2010
IEEE
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
162
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
154
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
179
click to vote
CVPR
2009
IEEE
16 years 1 months ago
2009
IEEE
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...