4171 search results - page 242 / 835 » Choice numbers of graphs |
165
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 ...
158
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...
187
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...
197
click to vote
COCOA
2009
Springer
16 years 1 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
200
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...