Sciweavers

385 search results - page 14 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
A fast asymptotically efficient algorithm for blind separation of a linear mixture of block-wise stationary autoregressive proce
We propose a novel blind source separation algorithm called Block AutoRegressive Blind Identification (BARBI). The algorithm is asymptotically efficient in separation of instant...
Petr Tichavský, Arie Yeredor, Zbynek Koldov...
FOCS
2000
IEEE
14 years 1 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
MST
2010
155views more  MST 2010»
13 years 3 months ago
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
We consider the important problem of energy balanced data propagation in wireless sensor networks and we extend and generalize previous works by allowing adaptive energy assignment...
Pierre Leone, Sotiris E. Nikoletseas, José ...
JCP
2008
171views more  JCP 2008»
13 years 9 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 1 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers