Results 1  10
of
12,767
A Faster Algorithm for Betweenness Centrality
 Journal of Mathematical Sociology
, 2001
"... The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require #(n ) time and #(n ) space, where n is the number of actors in the network. ..."
Abstract

Cited by 554 (5 self)
 Add to MetaCart
The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require #(n ) time and #(n ) space, where n is the number of actors in the network.
Faster algorithms for the shortest path problem
, 1990
"... Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with n vertices, mn edges, and nonnegative integer arc costs bounded by C, a onelevel form of radix heap gives a t ..."
Abstract

Cited by 135 (12 self)
 Add to MetaCart
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with n vertices, mn edges, and nonnegative integer arc costs bounded by C, a onelevel form of radix heap gives a
Faster algorithms for Frobenius numbers
, 2005
"... The Frobenius problem, also known as the postagestamp problem or the moneychanging problem, is an integer programming problem that seeks nonnegative integer solutions to x1a1 + ···+ xnan = M, whereaiand M are positive integers. In particular, the Frobenius number f(A), where A = {ai}, isthelargestM ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Mso that this equation fails to have a solution. A simple way to compute this number is to transform the problem to a shortestpath problem in a directed weighted graph; then Dijkstra’s algorithm can be used. We show how one can use the additional symmetry properties of the graph in question to design algorithms
Faster Algorithms for the Characteristic Polynomial
, 2007
"... A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected complexity of the algorithm is O(n θ) field operations, improving by a factor of log n on the worst case complexity of Keller– ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected complexity of the algorithm is O(n θ) field operations, improving by a factor of log n on the worst case complexity of Keller
Faster Algorithms for Multivariate Interpolation with
 Multiplicities and Simultaneous Polynomial Approximations”. In: arXiv CoRR abs/1402.0643 (2014) (see
"... Abstract—The interpolation step in the GuruswamiSudan algorithm is a bivariate interpolation problem with multiplicities commonly solved in the literature using either structured linear algebra or basis reduction of polynomial lattices. This problem has been extended to three or more variables; fo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—The interpolation step in the GuruswamiSudan algorithm is a bivariate interpolation problem with multiplicities commonly solved in the literature using either structured linear algebra or basis reduction of polynomial lattices. This problem has been extended to three or more variables
Faster Algorithms for Rigidity in the Plane
, 711
"... In [1], a new construction called redblack hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G = (V, E) with n vertices it runs in O(n 2) time assuming that a partition of (V, E + e) into two spanning trees is given. We show that a simple modi ..."
Abstract
 Add to MetaCart
In [1], a new construction called redblack hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G = (V, E) with n vertices it runs in O(n 2) time assuming that a partition of (V, E + e) into two spanning trees is given. We show that a simple
Faster Algorithm of String Comparison
"... In many applications, it is necessary to determine the string similarity *. Text comparison now appears in many disciplines such as compression, pattern recognition, computational biology, Web searching and data cleaning. Edit distance[WF74] approach is a classic method to determine Field Similarity ..."
Abstract
 Add to MetaCart
Similarity. A well known dynamic programming algorithm [GUS97] is used to calculate edit distance with the time complexity O(nm). (for worst case, average case and even best case) Instead of continuing with improving the edit distance approach, [LL+99] adopted a brand new approachtokenbased approach. Its
Faster Algorithm for Bisimulation Equivalence
"... Abstract. The fastest known algorithm for checking bisimulation equivalence of normed contextfree processes worked in O(n13) time. We give an alternative algorithm working in O(n8polylog n) time, As a side effect we improve the best known upper bound for testing equivalence of simple contextfree g ..."
Abstract
 Add to MetaCart
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed contextfree processes worked in O(n13) time. We give an alternative algorithm working in O(n8polylog n) time, As a side effect we improve the best known upper bound for testing equivalence of simple context
Faster Algorithms for Computer Vision
"... In this paper, we make a modification to Karl and Hartley‘s formulation of problems in computer vision [3, 4], and show the resulting norm minimization problem can be solved by solving a sequence of LP problems. We also propose an approximation of the norm minimization problem, which reduces to one ..."
Abstract
 Add to MetaCart
In this paper, we make a modification to Karl and Hartley‘s formulation of problems in computer vision [3, 4], and show the resulting norm minimization problem can be solved by solving a sequence of LP problems. We also propose an approximation of the norm minimization problem, which reduces to one LP or SOCP problem. Key words: Computer vision, multiple view geometry, linear programming, secondorder cone programming.
Results 1  10
of
12,767