×

Found 867 Documents (Results 1–100)

L1 regression with Lewis weights subsampling. (English) Zbl 07768394

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 49, 21 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Optimal testing of discrete distributions with high probability. (English) Zbl 07765192

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 542-555 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Near-optimal learning of tree-structured distributions by Chow-Liu. (English) Zbl 07765160

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 147-160 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A simple proof of a new set disjointness with applications to data streams. (English) Zbl 07711619

Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 37, 24 p. (2021).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sparse recovery. (English) Zbl 07469253

Roughgarden, Tim (ed.), Beyond the worst-case analysis of algorithms. Cambridge: Cambridge University Press. 140-164 (2021).
MSC:  68W40
PDFBibTeX XMLCite
Full Text: DOI Link

Modeling RNA:DNA hybrids with formal grammars. (English) Zbl 1460.92158

Segal, Rebecca (ed.) et al., Using mathematics to understand biological complexity. From cells to populations. Selected papers of the collaborative workshop for woman in mathematical biology, University of California, Los Angeles, CA, USA, June 17–21, 2019. Cham: Springer. Assoc. Women Math. Ser. 22, 35-54 (2021).
MSC:  92D20
PDFBibTeX XMLCite
Full Text: DOI

A fast binary splitting approach to non-adaptive group testing. (English) Zbl 07758315

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 13, 20 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Asymptotics of minimal deterministic finite automata recognizing a finite binary language. (English) Zbl 07651050

Drmota, Michael (ed.) et al., 31st international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2020, Klagenfurt, Austria (virtual conference), June 15–19, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 159, Article 11, 13 p. (2020).
MSC:  68W40
PDFBibTeX XMLCite
Full Text: DOI

Separations and equivalences between turnstile streaming and linear sketching. (English) Zbl 07298323

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 1223-1236 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Estimating the frequency of a clustered signal. (English) Zbl 07561529

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 36, 13 p. (2019).
MSC:  68Nxx 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Adaptive sparse recovery with limited adaptivity. (English) Zbl 1423.94019

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2729-2744 (2019).
MSC:  94A12 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software