166 search results - page 7 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
89
Voted
PDP
2003
IEEE
15 years 2 months ago
2003
IEEE
As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimi...
79
Voted
PUK
2000
14 years 11 months ago
2000
In this paper we discuss and describe preliminary results of integrating two strands of planning research - that of using plan graphs to speed up planning, and that of using object...
SC
2005
ACM
15 years 3 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
MCAM
2007
Springer
15 years 3 months ago
2007
Springer
A three-level method is proposed to achieve robust and real-time ball tracking in soccer videos. It includes object-, intra-trajectory-, and intertrajectory-level processing. Due t...