552 search results - page 19 / 111 » Constrained Shortest Path Computation |
COLING
2010
13 years 4 months ago
2010
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
TCOS
2010
13 years 8 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper we study the Carnot-Caratheodory metrics on SU(2) S3 , SO(3) and SL(2) induced by their Cartan decomposition and by the Killing form. Besides computing explicitly...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
ICCSA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...