Sciweavers

56 search results - page 1 / 12
» Computing the Determinant and Smith Form of an Integer Matri...
Sort
View
FOCS
2000
IEEE
13 years 9 months ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard
BMCBI
2007
233views more  BMCBI 2007»
13 years 4 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 8 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 2 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
SCL
2008
150views more  SCL 2008»
13 years 4 months ago
Interconnection of Kronecker canonical form and special coordinate basis of multivariable linear systems
This paper establishes a straightforward interconnection between the Kronecker canonical form and the special coordinate basis of linear systems. Such an interconnection yields an...
Ben M. Chen, Xinmin Liu, Zongli Lin