273 citations · 593 across the 29 of their papers we have counts for
6 papers · 1 filter
-freeness implies small dichromatic number
Krzysztof Choromanski
We propose a purely combinatorial quadratic time algorithm that for any -vertex -free tournament , where is a directed path of length , finds in a trans…
Fast Online Clustering with Randomized Skeleton Sets
Krzysztof Choromanski, Sanjiv Kumar, Xiaofeng Liu
We present a new fast online clustering algorithm that reliably recovers arbitrary-shaped data clusters in high throughout data streams. Unlike the existing state-of-the-art online…
Efficient data hashing with structured binary embeddings
Krzysztof Choromanski
We present here new mechanisms for hashing data via binary embeddings. Contrary to most of the techniques presented before, the embedding matrix of our mechanism is highly structur…
Coloring tournaments with forbidden substructures
Krzysztof Choromanski, Tony Jebara
Coloring graphs is an important algorithmic problem in combinatorics with many applications in computer science. In this paper we study coloring tournaments. A chromatic number of…
Learning how to rank from heavily perturbed statistics - digraph clustering approach
Krzysztof Choromanski
Ranking is one of the most fundamental problems in machine learning with applications in many branches of computer science such as: information retrieval systems, recommendation sy…
An -error online algorithm for retrieving heavily perturbated statistical databases in the low-dimensional querying mode
Krzysztof Choromanski, Afshin Rostamizadeh, Umar Syed
We give the first -error online algorithm for reconstructing noisy statistical databases, where is the number of (online) sample queries received…