×

Found 370 Documents (Results 1–100)

Local search approximation algorithms for the spherical \(k\)-means problem. (English) Zbl 1534.68266

Du, Ding-Zhu (ed.) et al., Algorithmic aspects in information and management. 13th international conference, AAIM 2019, Beijing, China, August 6–8, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11640, 341-351 (2019).
Full Text: DOI

Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes. (English) Zbl 1534.68261

Du, Ding-Zhu (ed.) et al., Algorithmic aspects in information and management. 13th international conference, AAIM 2019, Beijing, China, August 6–8, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11640, 159-168 (2019).
MSC:  68W25 62H30 68R10
Full Text: DOI

Parameterized \(k\)-clustering: tractability island. (English) Zbl 07650311

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 14, 15 p. (2019).
MSC:  68N30 68Qxx
Full Text: DOI

Accurate mapreduce algorithms for \(k\)-median and \(k\)-means in general metric spaces. (English) Zbl 07650267

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 34, 16 p. (2019).
MSC:  68Wxx

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

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

Minimization of Gini impurity: NP-completeness and approximation algorithm via connections with the \(k\)-means problem. (English) Zbl 07515212

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 567-576 (2019).
Full Text: DOI

Differential geometry for model independent analysis of images and other non-Euclidean data: recent developments. (English) Zbl 1443.62070

Sidoravicius, Vladas (ed.), Sojourns in probability theory and statistical physics. II. Brownian web and percolation, a festschrift for Charles M. Newman. Singapore: Springer; Shanghai: NYU Shanghai. Springer Proc. Math. Stat. 299, 1-43 (2019).

The derivative of the matrix geometric mean with an application to the nonnegative decomposition of tensor grids. (English) Zbl 1445.15017

Bini, Dario Andrea (ed.) et al., Structured matrices in numerical linear algebra. Analysis, algorithms and applications. Selected papers of the INdAM meeting on structured matrices in numerical linear algebra: analysis, algorithms and applications, Cortona, Italy, September 4–8, 2017. Cham: Springer. Springer INdAM Ser. 30, 107-128 (2019).
MSC:  15A60 26E60 47A64
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

all top 3

Software