UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Algorithmic High-Dimensional Robust Statistics

Diakonikolas, Ilias

2023

Volltextzugriff (PDF)

Sparser Johnson-Lindenstrauss Transforms

Journal of the ACM, 2014-01, Vol.61 (1), p.1-23, Article 4

2014

Volltextzugriff (PDF)

Near-optimal Linear Decision Trees for k-SUM and Related Problems

Journal of the ACM, 2019-06, Vol.66 (3), p.1-18, Article 16

2019

Volltextzugriff (PDF)

Testing Bayesian Networks

IEEE transactions on information theory, 2020-05, Vol.66 (5), p.3132-3170

2020

Volltextzugriff (PDF)

Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, p.184-195

2020

Volltextzugriff (PDF)

A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES

Forum of mathematics. Sigma, 2019, Vol.7, Article e17

2019

Volltextzugriff (PDF)

Small designs for path-connected spaces and path-connected homogeneous spaces

Transactions of the American Mathematical Society, 2015-09, Vol.367 (9), p.6387-6414

KANE, DANIEL M.

2015

Volltextzugriff (PDF)

Waring’s Theorem for Binary Powers

Combinatorica (Budapest. 1981), 2019-12, Vol.39 (6), p.1335-1350

2019

Volltextzugriff (PDF)

A New Approach for Testing Properties of Discrete Distributions

2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 2016, p.685-694

2016

Volltextzugriff (PDF)

Resolution of a conjecture of Andrews and Lewis involving cranks of partitions

Proceedings of the American Mathematical Society, 2004-08, Vol.132 (8), p.2247-2256

KANE, Daniel M

2004

Volltextzugriff (PDF)

AN ASYMPTOTIC FOR THE NUMBER OF SOLUTIONS TO LINEAR EQUATIONS IN PRIME NUMBERS FROM SPECIFIED CHEBOTAREV CLASSES

International journal of number theory, 2013-06, Vol.9 (4), p.1073-1111

KANE, DANIEL M.

2013

Volltextzugriff (PDF)

The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions

2010 IEEE 25th Annual Conference on Computational Complexity, 2010, p.205-210

Kane, Daniel M

2010

Volltextzugriff (PDF)

List-decodable robust mean estimation and learning mixtures of spherical gaussians

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, p.1047-1060

2018

Volltextzugriff (PDF)

Closed expressions for averages of set partition statistics

Research in the mathematical sciences, 2014-12, Vol.1 (1), Article 2

2014

Volltextzugriff (PDF)

Learning geometric concepts with nasty noise

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, p.1061-1073

2018

Volltextzugriff (PDF)

Pseudorandomness via the Discrete Fourier Transform

SIAM journal on computing, 2018-01, Vol.47 (6), p.2451-2487

2018

Volltextzugriff (PDF)

The correct exponent for the Gotsman–Linial Conjecture

Computational complexity, 2014-06, Vol.23 (2), p.151-175

Kane, Daniel M.

2014

Volltextzugriff (PDF)

Locality Bounds for Sampling Hamming Slices

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, p.1279-1286

2024

Volltextzugriff (PDF)

Testing Closeness of Multivariate Distributions via Ramsey Theory

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, p.340-347

2024

Volltextzugriff (PDF)

Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions

2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, p.1183-1202

2015

Volltextzugriff (PDF)

A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, p.1741-1754

2023

Volltextzugriff (PDF)

Prisoners, Rooms, and Light Switches

The Electronic journal of combinatorics, 2021-02, Vol.28 (1)

2021

Volltextzugriff (PDF)

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, p.73-84

2017

Volltextzugriff (PDF)

Canonical Projective Embeddings of the Deligne–Lusztig Curves Associated to 2 A 2 , 2 B 2 , and 2 G 2

International mathematics research notices, 2016, Vol.2016 (4), p.1158-1189

Kane, Daniel M.

2016

Volltextzugriff (PDF)

On the ranks of the 2-Selmer groups of twists of a given elliptic curve

Algebra & Number Theory, 2013-01, Vol.7 (5), p.1253-1279

Kane, Daniel

2013

Volltextzugriff (PDF)

1 – 25 von 692

Menü

Weitere Dienste

Einstellungen

Algorithmic High-Dimensional Robust Statistics

Sparser Johnson-Lindenstrauss Transforms

Near-optimal Linear Decision Trees for k-SUM and Related Problems

Testing Bayesian Networks

Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models

A PROOF OF ANDREWS’ CONJECTURE ON PARTITIONS WITH NO SHORT SEQUENCES

Small designs for path-connected spaces and path-connected homogeneous spaces

Waring’s Theorem for Binary Powers

A New Approach for Testing Properties of Discrete Distributions

Resolution of a conjecture of Andrews and Lewis involving cranks of partitions

AN ASYMPTOTIC FOR THE NUMBER OF SOLUTIONS TO LINEAR EQUATIONS IN PRIME NUMBERS FROM SPECIFIED CHEBOTAREV CLASSES

The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions

List-decodable robust mean estimation and learning mixtures of spherical gaussians

Closed expressions for averages of set partition statistics

Learning geometric concepts with nasty noise

Pseudorandomness via the Discrete Fourier Transform

The correct exponent for the Gotsman–Linial Conjecture

Locality Bounds for Sampling Hamming Slices

Testing Closeness of Multivariate Distributions via Ramsey Theory

Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions

A Strongly Polynomial Algorithm for Approximate Forster Transforms and Its Application to Halfspace Learning

Prisoners, Rooms, and Light Switches

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures

Canonical Projective Embeddings of the Deligne–Lusztig Curves Associated to 2 A 2 , 2 B 2 , and 2 G 2

On the ranks of the 2-Selmer groups of twists of a given elliptic curve

Suchergebnisse filtern