24 search results - page 4 / 5 » Replacement Paths via Fast Matrix Multiplication |
SIAMCOMP
2010
14 years 4 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...
108
Voted
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
119
click to vote
CP
2003
Springer
15 years 2 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
PAKDD
2004
ACM
15 years 2 months ago
2004
ACM
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
VTC
2007
IEEE
15 years 3 months ago
2007
IEEE
— OFDM is well suited for data-transmission over frequency-selective channels. If the cyclic prefix is chosen sufficiently long, intersymbol interference is avoided. Thus, the ...