467 search results - page 18 / 94 » Acceleration of Shortest Path and Constrained Shortest Path ... |
COLING
2010
13 years 2 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...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed...
ICALP
2004
Springer
14 years 24 days ago
2004
Springer
TCOS
2010
13 years 5 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...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
Abstract Summary of results The subcubic (O(n ) for < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they d...