( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Randomized Low-Memory Singular Value Projection

, , и . CoRR, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Anastasios Giannitsis

Anastasios Moissidis

Anastasios Maniatoglou

Anastasios Giannakis

Anastasios Pantasidis

 

Другие публикации лиц с тем же именем

Compressive mining: fast and optimal data mining in the compressed domain., , и . VLDB J., 24 (1): 1-24 (2015)Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments., и . ICASSP, стр. 3856-3859. IEEE, (2011)Low-rank regularization and solution uniqueness in over-parameterized matrix sensing., , и . AISTATS, том 108 из Proceedings of Machine Learning Research, стр. 930-940. PMLR, (2020)Compressing Gradient Optimizers via Count-Sketches., , , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 5946-5955. PMLR, (2019)Learning Sparse Additive Models with Interactions in High Dimensions., , , и . AISTATS, том 51 из JMLR Workshop and Conference Proceedings, стр. 111-120. JMLR.org, (2016)Bipartite Correlation Clustering: Maximizing Agreements., , , и . AISTATS, том 51 из JMLR Workshop and Conference Proceedings, стр. 121-129. JMLR.org, (2016)Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions., , , и . Artif. Intell., (2021)FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints., , , и . CoRR, (2019)How Much Pre-training Is Enough to Discover a Good Subnetwork?, , , , и . Trans. Mach. Learn. Res., (2024)Multi-Way Compressed Sensing for Sparse Low-Rank Tensors., и . IEEE Signal Process. Lett., 19 (11): 757-760 (2012)