1172 search results - page 12 / 235 » Path Algorithms on Regular Graphs |
81
Voted
STOC
2003
ACM
16 years 24 days ago
2003
ACM
97
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
This article proposes a new framework to regularize linear inverse problems using the total variation on non-local graphs. This nonlocal graph allows to adapt the penalization to t...
111
click to vote
SIAMCOMP
2010
14 years 7 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...