832 search results - page 15 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
127
click to vote
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
118
click to vote
WEA
2010
Springer
15 years 5 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
92
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
109
Voted
MOBIHOC
2005
ACM
16 years 1 days ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...