activity
20112021
most citedOptimal Algorithms for -subspace Signal Processing

171 citations · 171 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CR2021

Improved Pan-Private Stream Density Estimation

Vassilis Digalakis, George N. Karystinos, Minos N. Garofalakis

Differential privacy is a rigorous definition for privacy that guarantees that any analysis performed on a sensitive dataset leaks no information about the individuals whose data a…

cs.DS2014★ 171 cited

Optimal Algorithms for -subspace Signal Processing

Panos P. Markopoulos, George N. Karystinos, Dimitris A. Pados

We describe ways to define and calculate -norm signal subspaces which are less sensitive to outlying data than -calculated subspaces. We start with the computation of the…

cs.IT2014

Fixed-rank Rayleigh Quotient Maximization by an PSK Sequence

Anastasios Kyrillidis, George N. Karystinos

Certain optimization problems in communication systems, such as limited-feedback constant-envelope beamforming or noncoherent -ary phase-shift keying (PSK) sequence detection…

cs.IT2013

The Sparse Principal Component of a Constant-rank Matrix

Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optim…

stat.ML2013

Some Options for L1-Subspace Signal Processing

Panos P. Markopoulos, George N. Karystinos, Dimitris A. Pados

We describe ways to define and calculate -norm signal subspaces which are less sensitive to outlying data than -calculated subspaces. We focus on the computation of the $…

cs.IT2011

Sparse Principal Component of a Rank-deficient Matrix

Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos

We consider the problem of identifying the sparse principal component of a rank-deficient matrix. We introduce auxiliary spherical variables and prove that there exists a set of ca…