Global ETD Search

Algorithms for Subset Sum using linear sketching

Axiotis, Kyriakos.Massachusetts Institute of Technology2019

… and, recently, algorithms running in near-linear pseudo-polynomial time were developed [9, 211. For the modular case, however, the best known algorithm by Koiliaris and Xu [21] runs in time 0̃ (m⁵/⁴). In this thesis we tackle this problem by devising a faster algorithm for the Modular …

mit Repository record for Algorithms for Subset Sum using linear sketching (opens in a new tab)

Advances in sparse signal recovery methods

Berinde, RaduMassachusetts Institute of Technology2009

… in signal acquisition, data compression, sub-linear space algorithms, etc. In this thesis we focus on sparse recovery, where the goal is to recover sparse vectors exactly, and to approximately recover nearly-sparse vectors. More precisely, from the short representation of a vector x, we want …

mit Repository record for Advances in sparse signal recovery methods (opens in a new tab)

Scalable Estimation on Linear and Nonlinear Regression Models via Decentralized Processing: Adaptive LMS Filter and Gaussian Process Regression

Nakai, AyanoKyoto University2021

kyoto Repository record for Scalable Estimation on Linear and Nonlinear Regression Models via Decentralized Processing: Adaptive LMS Filter and Gaussian Process Regression (opens in a new tab)