×

Found 1,096 Documents (Results 1–100)

A novel prediction setup for online speed-scaling. (English) Zbl 07853681

Czumaj, Artur (ed.) et al., 18th Scandinavian symposium and workshops on algorithm theory, SWAT 2022, Tórshavn, Faroe Islands, June 27–29, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 227, Article 9, 20 p. (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Improved quantum lower and upper bounds for matrix scaling. (English) Zbl 07836602

Berenbrink, Petra (ed.) et al., 39th international symposium on theoretical aspects of computer science, STACS 2022, Marseille, France, virtual conference, March 15–18, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 219, Article 35, 23 p. (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Transposition and time-scaling invariant algorithm for detecting repeated patterns in polyphonic music. (English) Zbl 1495.00026

Montiel, Mariana (ed.) et al., Mathematics and computation in music. 8th international conference, MCM 2022, Atlanta, GA, USA, June 21–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13267, 168-179 (2022).
MSC:  00A65 68T10
PDFBibTeX XMLCite
Full Text: DOI

Capacity lower bounds via productization. (English) Zbl 07765215

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). 847-858 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Barriers for recent methods in geodesic optimization. (English) Zbl 07711595

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 13, 54 p. (2021).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimizing total completion time in multiprocessor job systems with energy constraint. (English) Zbl 1485.90044

Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 267-279 (2021).
MSC:  90B35 68M20 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

WITHDRAWN: Structured condition numbers for the total least squares problem with linear equality constraint and their statistical estimation. arXiv:2105.08132

Preprint, arXiv:2105.08132 [math.NA] (2021); retraction notice ibid.
MSC:  65F20 65F35 65F30 15A12 15A60
BibTeX Cite
Full Text: arXiv

Scaling and local limits of Baxter permutations through coalescent-walk processes. (English) Zbl 07651046

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 7, 18 p. (2020).
MSC:  68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Robust online speed scaling with deadline uncertainty. (English) Zbl 1521.68265

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 22, 17 p. (2018).
MSC:  68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory. (English) Zbl 1462.90097

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 24, 20 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Spectrum approximation beyond fast matrix multiplication: algorithms and hardness. (English) Zbl 1462.68082

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 8, 21 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Small coarse spaces for overlapping Schwarz algorithms with irregular subdomains. (English) Zbl 1450.65177

Bjørstad, Petter E. (ed.) et al., Domain decomposition methods in science and engineering XXIV. Proceedings of the 24th international conference, Svalbard, Norway, February 6–10, 2017. Cham: Springer. Lect. Notes Comput. Sci. Eng. 125, 553-560 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. (English) Zbl 1427.90213

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 172-181 (2018).
MSC:  90C25 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

From the strict Chebyshev approximant of a vector to the strict spectral approximant of a matrix. (English) Zbl 1421.65010

Zemánek, Jaroslav (ed.) et al., Études opératorielles. Warsaw: Polish Academy of Sciences, Institute of Mathematics. Banach Cent. Publ. 112, 307-346 (2017).
PDFBibTeX XMLCite
Full Text: DOI Link

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

Biographic Reference

all top 3

Software