Results 1  10
of
81
AllPairs Bottleneck Paths For General Graphs in Truly SubCubic Time
 STOC'07
, 2007
"... In the allpairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real nonnegative capacities on its edges and is asked to determine, for all pairs of vertices s and t, the capacity of a single path for which a maximum amount of flow can b ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
be routed from s to t. The APBP problem was first studied in operations research, shortly after the introduction of maximum flows and allpairs shortest paths. We present the first truly subcubic algorithm for APBP in general dense graphs. In particular, we give a procedure for computing the (max
Fast Matching of Planar Shapes in Subcubic Runtime
"... The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local similarity of respective points on each contour. While this problem can be solved using Dynamic Time Warping, the complete sear ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
search over the initial correspondence leads to cubic runtime in the number of sample points. In this paper, we cast the shape matching problem as one of finding the shortest circular path on a torus. We propose an algorithm to determine this shortest cycle which has provably subcubic runtime. Numerical
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
 Algorithmica
, 1995
"... . In this paper we give three subcubic cost algorithms for the all pairs shortest distance (APSD) and path (APSP) problems. The first is a parallel algorithm that solves the APSD problem for a directed graph with unit edge costs in O(log 2 n) time with O(n ffi p log n) processors where = 2:68 ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
. In this paper we give three subcubic cost algorithms for the all pairs shortest distance (APSD) and path (APSP) problems. The first is a parallel algorithm that solves the APSD problem for a directed graph with unit edge costs in O(log 2 n) time with O(n ffi p log n) processors where = 2
A Subcubic Time Algorithm for the kMaximum Subarray Problem
"... Abstract. We design a faster algorithm for the kmaximum subarray problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n 3 √ log log n/log n + k log n) for a general problem where overlapping is allowed for solution arrays. This complexi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. This complexity is subcubic when k = o(n 3 / log n). The best known complexities of this problem are O(n 3 + k log n), which is cubic when k = O(n 3 /log n), and O(kn 3 √ log log n / log n), which is subcubic when k = o ( √ log n / log log n). 1
AllPairs Bottleneck Paths in Vertex Weighted Graphs
 In Proc. of SODA, 978–985
, 2007
"... Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v), ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
multiplication. Our algorithm is the first subcubic algorithm for this problem. Unlike the subcubic algorithm for the allpairs shortest paths (APSP) problem, that only applies to bounded (or relatively small) integer edge or vertex weights, the algorithm presented for APBP problem works for arbitrary large
A subcubic time algorithm for computing the quartet distance between two general trees
, 2011
"... ..."
A subcubic time algorithm for computing the quartet distance between two general trees
, 2009
"... ..."
Finding a maximum weight triangle in n 3−δ time, with applications
 In Proc. of STOC
, 2006
"... We present the first truly subcubic algorithms for finding a maximum nodeweighted triangle in directed and undirected graphs with arbitrary real weights. The first is an O(B · n 3+ω 2) = O(B · n 2.688) deterministic algorithm, where n is the number of nodes, ω is the matrix multiplication exponen ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
We present the first truly subcubic algorithms for finding a maximum nodeweighted triangle in directed and undirected graphs with arbitrary real weights. The first is an O(B · n 3+ω 2) = O(B · n 2.688) deterministic algorithm, where n is the number of nodes, ω is the matrix multiplication
Efficient algorithms on sets of permutations, dominance, and realweighted APSP
"... Sets of permutations play an important role in the design of some efficient algorithms. In this paper we design two algorithms that manipulate sets of permutations. Both algorithms, each solving a different problem, use fast matrix multiplication techniques to achieve a significant improvement in th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
known O(n2.688) time algorithm of Matousek for the dominance problem. Permutation dominance is used, together with several other ingredients, to obtain a truly subcubic algorithm for the All Pairs Shortest Paths (APSP) problem in realweighted directed graphs, where the number of distinct weights
Channel Estimation Techniques Based on Pilot Arrangement in OFDM Systems
 IEEE Trans. Broadcasting
, 2002
"... The channel estimation techniques for OFDM systems based on pilot arrangement are investigated. The channel estimation based on comb type pilot arrangement is studied through different algorithms for both estimating channel at pilot frequencies and interpolating the channel. The estimation of channe ..."
Abstract

Cited by 150 (2 self)
 Add to MetaCart
The channel estimation techniques for OFDM systems based on pilot arrangement are investigated. The channel estimation based on comb type pilot arrangement is studied through different algorithms for both estimating channel at pilot frequencies and interpolating the channel. The estimation
Results 1  10
of
81