1172 search results - page 95 / 235 » Path Algorithms on Regular Graphs |
199
click to vote
PC
2010
15 years 5 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
183
click to vote
TCSV
2008
15 years 6 months ago
2008
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...
210
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
183
click to vote
ICALP
2004
Springer
16 years 1 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
156
click to vote
COMPGEOM
1990
ACM
15 years 10 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...