3204 search results - page 130 / 641 » The Alcuin Number of a Graph |
160
click to vote
CVPR
2009
IEEE
16 years 20 days 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...
176
click to vote
COCOA
2009
Springer
16 years 12 days 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...
176
click to vote
ICPP
2002
IEEE
15 years 10 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...
145
click to vote
STACS
2010
Springer
16 years 25 days ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
150
click to vote
WG
2009
Springer
16 years 13 days ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...