( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Generalization Bounds for Data-Driven Numerical Linear Algebra.

, , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 2013-2040. PMLR, (2022)

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.

Berthold Piotrowski

Jens Piotraschke

Susanne Piotrowski-Allert

Sven Piotrowiak

Katja Piotrowski

 

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

A Nearly-Linear Time Framework for Graph-Structured Sparsity., , и . ICML, том 37 из JMLR Workshop and Conference Proceedings, стр. 928-937. JMLR.org, (2015)Efficient Computations of l1 and linfinity Rearrangement Distances., , , , и . SPIRE, том 4726 из Lecture Notes in Computer Science, стр. 39-49. Springer, (2007)High-dimensional computational geometry.. Stanford University, USA, (2000)Generalization Bounds for Data-Driven Numerical Linear Algebra., , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 2013-2040. PMLR, (2022)Which Regular Expression Patterns are Hard to Match?, и . CoRR, (2015)Declaring independence via the sketching of sketches., и . SODA, стр. 737-745. SIAM, (2008)Polylogarithmic Private Approximations and Efficient Matching., и . TCC, том 3876 из Lecture Notes in Computer Science, стр. 245-264. Springer, (2006)Seismic feature extraction using steiner tree methods., , , , , и . ICASSP, стр. 1647-1651. IEEE, (2015)When Crossings Count - Approximating the Minimum Spanning Tree, и . CoRR, (2003)Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching., , , и . SODA, стр. 318-337. SIAM, (2016)