273 citations · 1.5k across the 75 of their papers we have counts for
5 papers · 1 filter
The Strong EH-Property and the Erdős-Hajnal Conjecture
Krzysztof Choromanski
The Erdős-Hajnal Conjecture states that for every there exists a constant such that every graph that does not contain as an induced subgraph contains a clique…
All known prime Erdős-Hajnal tournaments satisfy
Krzysztof Choromanski
We prove that there exists such that , where is the Erdős-Hajnal coefficient of the tournament , for every prime tournament $H…
Excluding pairs of tournaments
Krzysztof Choromanski
The Erdős-Hajnal conjecture states that for every given undirected graph there exists a constant such that every graph that does not contain as an induced subg…
Notes on using Determinantal Point Processes for Clustering with Applications to Text Clustering
Apoorv Agarwal, Anna Choromanska, Krzysztof Choromanski
In this paper, we compare three initialization schemes for the KMEANS clustering algorithm: 1) random initialization (KMEANSRAND), 2) KMEANS++, and 3) KMEANSD++. Both KMEANSRAND an…
Differentially- and non-differentially-private random decision trees
Mariusz Bojarski, Anna Choromanska, Krzysztof Choromanski +1
We consider supervised learning with random decision trees, where the tree construction is completely random. The method is popularly used and works well in practice despite the si…