1162 search results - page 63 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
ICDCS
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
JCSS
2011
13 years 3 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper deals with optimizing the task cycle time of industrial robots integrated in complex robot cells. Trajectory optimizers are usually based on models and can’t properly...