707 search results - page 34 / 142 » Solving path problems on the GPU |
207
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
103
click to vote
ICMCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We present a method to track and estimate the motion of a 3D object with a monocular image sequence. The problem is based on the state equations and is solved by a sequential Mont...
CCGRID
2010
IEEE
15 years 28 days ago
2010
IEEE
Finite difference methods continue to provide an important and parallelisable approach to many numerical simulations problems. Iterative multigrid and multilevel algorithms can co...
115
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We present the design and implementation of new inexact Newton type Bundle Adjustment algorithms that exploit hardware parallelism for efficiently solving large scale 3D scene re...
ALENEX
2004
15 years 1 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...