Sciweavers

847 search results - page 105 / 170
» Approximation algorithms for projective clustering
Sort
View
VTC
2007
IEEE
104views Communications» more  VTC 2007»
15 years 7 months ago
Subspace Tracking Based Blind MIMO Transmit Preprocessing
Abstract— In this contribution projection approximation subspace tracking using deflation (PASTD) is investigated in the context of MIMO transmit preprocessing systems by exploi...
Wei Liu, Lie-Liang Yang, Lajos Hanzo
ECCV
2010
Springer
15 years 5 months ago
Practical Autocalibration
As it has been noted several times in literature, the difficult part of autocalibration efforts resides in the structural non-linearity of the search for the plane at infinity. I...
135
Voted
ISSAC
1995
Springer
174views Mathematics» more  ISSAC 1995»
15 years 4 months ago
Numerical Uniformization of Hyperelliptic Curves
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...
Klaus-Dieter Semmler, Mika Seppälä
ICA
2010
Springer
15 years 1 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies
SODA
2003
ACM
107views Algorithms» more  SODA 2003»
15 years 2 months ago
Fault-tolerant facility location
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...
Chaitanya Swamy, David B. Shmoys