2796 search results - page 170 / 560 » The coolest path problem |
182
click to vote
TIP
2010
15 years 1 months ago
2010
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
150
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
197
click to vote
BCB
2010
15 years 1 months ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
166
click to vote
ALENEX
2004
15 years 8 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...
166
click to vote
MP
2008
15 years 6 months ago
2008
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...