Sciweavers

772 search results - page 14 / 155
» Hyper-Systolic Matrix Multiplication
Sort
View
141
Voted
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 10 months ago
Maximum Matchings in Planar Graphs via Gaussian Elimination
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
Marcin Mucha, Piotr Sankowski
156
Voted
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
151
Voted
SIAMSC
2010
160views more  SIAMSC 2010»
15 years 3 months ago
Shift-Invert Arnoldi Approximation to the Toeplitz Matrix Exponential
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and...
Spike T. Lee, Hong-Kui Pang, Hai-Wei Sun
3DIM
2005
IEEE
15 years 11 months ago
Fast Simultaneous Alignment of Multiple Range Images Using Index Images
This paper describes a fast, simultaneous alignment method for a large number of range images. Generally the most time-consuming task in aligning range images is searching corresp...
Takeshi Oishi, Atsushi Nakazawa, Ryo Kurazume, Kat...