707 search results - page 51 / 142 » Solving path problems on the GPU |
GD
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
104
click to vote
PAMI
2010
14 years 10 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
CGF
2008
14 years 12 months ago
2008
Typically, flow volumes are visualized by defining their boundary as iso-surface of a level set function. Grid-based level sets offer a good global representation but suffer from ...
IMC
2009
ACM
15 years 6 months ago
2009
ACM
Replicating content across a geographically distributed set of servers and redirecting clients to the closest server in terms of latency has emerged as a common paradigm for impro...