400 search results - page 12 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
The front end of many motion analysis algorithms is usually a process that generates bounding boxes around each moving object, roughly segmenting the objects from the background. ...
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
ISHPC
2003
Springer
15 years 2 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
WSC
2007
14 years 11 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
DAGSTUHL
2008
14 years 11 months ago
2008
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...