Sciweavers

76 search results - page 8 / 16
» On the Complexity of Matrix Rank and Rigidity
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Classifying matrices with a spectral regularization
We propose a method for the classification of matrices. We use a linear classifier with a novel regularization scheme based on the spectral 1-norm of its coefficient matrix. The s...
Ryota Tomioka, Kazuyuki Aihara
CVPR
2005
IEEE
14 years 9 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
TSP
2011
152views more  TSP 2011»
13 years 2 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
CVPR
2007
IEEE
14 years 9 months ago
Autocalibration via Rank-Constrained Estimation of the Absolute Quadric
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
Manmohan Krishna Chandraker, Sameer Agarwal, Fredr...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky