Search Results - "Papailiopoulos, Dimitris"
-
1
Optimal Locally Repairable Codes and Connections to Matroid Theory
Published in IEEE transactions on information theory (01-12-2016)“…Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes, such as…”
Get full text
Journal Article -
2
Locality and Availability in Distributed Storage
Published in IEEE transactions on information theory (01-08-2016)“…This paper studies the problem of information symbol availability in codes: we refer to a systematic code as code with (r, t)-availability if every information…”
Get full text
Journal Article -
3
Interference Alignment as a Rank Constrained Rank Minimization
Published in IEEE transactions on signal processing (01-08-2012)“…We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel (IC) is…”
Get full text
Journal Article -
4
A Repair Framework for Scalar MDS Codes
Published in IEEE journal on selected areas in communications (01-05-2014)“…Several works have developed vector-linear maximum-distance separable (MDS) storage codes that minimize the total communication cost required to repair a…”
Get full text
Journal Article -
5
Repair Optimal Erasure Codes Through Hadamard Designs
Published in IEEE transactions on information theory (01-05-2013)“…In distributed storage systems that employ erasure coding, the issue of minimizing the total communication required to exactly rebuild a storage node after a…”
Get full text
Journal Article -
6
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Published in IEEE transactions on wireless communications (01-06-2010)“…We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time…”
Get full text
Journal Article -
7
The Sparse Principal Component of a Constant-Rank Matrix
Published in IEEE transactions on information theory (01-04-2014)“…The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum…”
Get full text
Journal Article -
8
Maximum-Likelihood Noncoherent PAM Detection
Published in IEEE transactions on communications (01-03-2013)“…Sequence detection offers improved error-rate performance over conventional symbol-by-symbol detection when channel knowledge is not available at the receiver…”
Get full text
Journal Article -
9
Speeding Up Distributed Machine Learning Using Codes
Published in IEEE transactions on information theory (01-03-2018)“…Codes are widely used in many engineering applications to offer robustness against noise . In large-scale systems, there are several types of noise that can…”
Get full text
Journal Article -
10
Locally Repairable Codes
Published in IEEE transactions on information theory (01-10-2014)“…Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large…”
Get full text
Journal Article -
11
Optimal OSTBC sequence detection over unknown correlated fading channels
Published in 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers (01-11-2009)“…We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded (OSTBC) signals can be performed in polynomial time…”
Get full text
Conference Proceeding -
12
Optimal locally repairable codes and connections to matroid theory
Published in 2013 IEEE International Symposium on Information Theory (01-07-2013)“…Petabyte-scale distributed storage systems are currently transitioning to erasure codes to achieve higher storage efficiency. Classical codes like Reed-Solomon…”
Get full text
Conference Proceeding -
13
Locality and availability in distributed storage
Published in 2014 IEEE International Symposium on Information Theory (01-06-2014)“…This paper studies the problem of code symbol availability: a code symbol is said to have (r; t)-availability if it can be reconstructed from t disjoint groups…”
Get full text
Conference Proceeding -
14
Simple regenerating codes: Network coding for cloud storage
Published in 2012 Proceedings IEEE INFOCOM (01-03-2012)“…Network codes designed specifically for distributed storage systems have the potential to provide dramatically higher storage efficiency for the same…”
Get full text
Conference Proceeding -
15
Combinatorial QPs via a low-dimensional subspace sampling
Published in 2014 48th Annual Conference on Information Sciences and Systems (CISS) (01-03-2014)“…Several large scale data processing problems can be formulated as quadratic programs subject to combinatorial constraints. We present a novel low-rank…”
Get full text
Conference Proceeding -
16
Availability and locality in distributed storage
Published in 2013 IEEE Global Conference on Signal and Information Processing (01-12-2013)“…Modern distributed file systems are deploying erasure codes to increase storage efficiency compared to block replication. Initially, classical error-correcting…”
Get full text
Conference Proceeding -
17
Gradient Coding Using the Stochastic Block Model
Published in 2018 IEEE International Symposium on Information Theory (ISIT) (01-06-2018)“…Gradient descent and its many variants, including mini-batch stochastic gradient descent, form the algorithmic foundation of modern large-scale machine…”
Get full text
Conference Proceeding -
18
Coded computation for multicore setups
Published in 2017 IEEE International Symposium on Information Theory (ISIT) (01-06-2017)“…Consider a distributed computing setup consisting of a master node and n worker nodes, each equipped with p cores, and a function f (x) = g(f 1 (x), f 2…”
Get full text
Conference Proceeding -
19
Speeding up distributed machine learning using codes
Published in 2016 IEEE International Symposium on Information Theory (ISIT) (01-07-2016)“…Distributed machine learning algorithms that are widely run on modern large-scale computing platforms face several types of randomness, uncertainty and system…”
Get full text
Conference Proceeding Journal Article -
20
The Expressive Power of Tuning Only the Normalization Layers
Published 15-02-2023“…Feature normalization transforms such as Batch and Layer-Normalization have become indispensable ingredients of state-of-the-art deep neural networks. Recent…”
Get full text
Journal Article