Sciweavers

416 search results - page 32 / 84
» Processing Textbook-Style Matrices
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
14 years 1 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
ICA
2007
Springer
13 years 11 months ago
Gradient Convolution Kernel Compensation Applied to Surface Electromyograms
Abstract. This paper introduces gradient based method for robust assessment of the sparse pulse sources, such as motor unit innervation pulse trains in the filed of electromyograp...
Ales Holobar, Damjan Zazula
ICASSP
2010
IEEE
13 years 10 months ago
On distance reconstruction for sensor network localization
Sensor localization typically exploits distance measurements to infer sensor positions with respect to known anchor nodes. Missing or unreliable measurements for specific nodes c...
Phillip A. Regalia, Jing Wang
ICASSP
2010
IEEE
13 years 10 months ago
A nullspace analysis of the nuclear norm heuristic for rank minimization
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
Krishnamurthy Dvijotham, Maryam Fazel
ICASSP
2010
IEEE
13 years 10 months ago
Approximate eigenvalue decomposition of para-Hermitian systems through successive FIR paraunitary transformations
The eigenvalue decomposition (EVD) of a Hermitian matrix in terms of unitary matrices is well known. In this paper, we present an algorithm for the approximate EVD (AEVD) of a par...
Andre Tkacenko