×

Found 1,045 Documents (Results 1–100)

100
MathJax

Some problems related to the space of optimal tree reconciliations (invited talk). (English) Zbl 07556556

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 3-14 (2022).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Fair correlation clustering with global and local guarantees. (English) Zbl 07498693

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 414-427 (2021).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Parameterized complexity of categorical clustering with size constraints. (English) Zbl 07498691

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 385-398 (2021).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Distributed detection of clusters of arbitrary size. (English) Zbl 07495150

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 370-387 (2021).
MSC:  68Mxx 68Q11 68R10
PDF BibTeX XML Cite
Full Text: DOI

A distributed algorithm for spectral sparsification of graphs with applications to data clustering. (English) Zbl 1483.68259

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 403-413 (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability. (English. Russian original) Zbl 07377486

Proc. Steklov Inst. Math. 313, Suppl. 1, S117-S124 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 25, No. 4, 69-78 (2019).
MSC:  68W25
PDF BibTeX XML Cite
Full Text: DOI

Graph clustering in all parameter regimes. (English) Zbl 07559410

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 39, 15 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs. (English) Zbl 1482.68176

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 97-107 (2020).
MSC:  68R10 05C70 68W25
PDF BibTeX XML Cite
Full Text: DOI

Nonlinear system identification. From classical approaches to neural networks, fuzzy models, and Gaussian processes. 2nd edition. (English) Zbl 1453.93001

Cham: Springer (ISBN 978-3-030-47438-6/hbk; 978-3-030-47439-3/ebook). xxviii, 1225 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI

Tight FPT approximations for \(k\)-median and \(k\)-means. (English) Zbl 07561535

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 42, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

On the fixed-parameter tractability of capacitated clustering. (English) Zbl 07561534

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 41, 14 p. (2019).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Large-scale distributed algorithms for facility location with outliers. (English) Zbl 07561433

Cao, Jiannong (ed.) et al., 22nd international conference on principles of distributed systems, OPODIS 2018, December 17–19, 2018, Hong Kong, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 125, Article 5, 16 p. (2019).
MSC:  68M14 68M20
PDF BibTeX XML Cite
Full Text: DOI

Correlation clustering with same-cluster queries bounded by optimal cost. (English) Zbl 07525518

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 81, 17 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Greedy strategy works for \(k\)-center clustering with outliers and coreset construction. (English) Zbl 07525477

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 40, 16 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

On computing centroids according to the \(p\)-norms of Hamming distance vectors. (English) Zbl 07525465

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 28, 16 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Constant-factor FPT approximation for capacitated \(k\)-Median. (English) Zbl 07525438

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 1, 14 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Resolving conflicts for lower-bounded clustering. (English) Zbl 07378609

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 23, 14 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Graph-based optimization approaches for machine learning, uncertainty quantification and networks. (English) Zbl 1446.65032

Kimmel, Ron (ed.) et al., Processing, analyzing and learning of images, shapes, and forms. Part 2. Amsterdam: Elsevier/North Holland. Handb. Numer. Anal. 20, 503-531 (2019).
PDF BibTeX XML Cite
Full Text: DOI

Min-max correlation clustering via multicut. (English) Zbl 1436.90114

Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 20th international conference, IPCO 2019, Ann Arbor, MI, USA, May 22–24, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11480, 13-26 (2019).
MSC:  90C27 90C59
PDF BibTeX XML Cite
Full Text: DOI arXiv

Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering. (English) Zbl 1433.68366

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1027-1038 (2019).
MSC:  68T05 62H30 68R12
PDF BibTeX XML Cite
Full Text: DOI arXiv

Approximation algorithms for minimum norm and ordered optimization problems. (English) Zbl 1433.68612

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 126-137 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Efficient nearest-neighbor query and clustering of planar curves. (English) Zbl 07152198

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 28-42 (2019).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem. (English. Russian original) Zbl 07150939

Comput. Math. Math. Phys. 59, No. 9, 1553-1561 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617-1625 (2019).
MSC:  68Q25 90C20
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software