62 citations · 316 across the 38 of their papers we have counts for
6 papers · 1 filter
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting
Andrzej Pacuk, Piotr Sankowski, Karol Węgrzycki +2
We present the Mim-Solution's approach to the RecSys Challenge 2016, which ranked 2nd. The goal of the competition was to prepare job recommendations for the users of the website X…
Budget Feasible Mechanisms on Matroids
Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski +1
Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we…
There is Something Beyond the Twitter Network
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki +1
How information spreads through a social network? Can we assume, that the information is spread only through a given social network graph? What is the correct way to compare the mo…
Locality-Sensitive Hashing without False Negatives for l_p
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki +1
In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius …
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Piotr Sankowski, Karol Węgrzycki
Consider an unweighted, directed graph with the diameter . In this paper, we introduce the framework for counting cycles and walks of given length in matrix multiplication t…
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Time
Michael B. Cohen, Aleksander Madry, Piotr Sankowski +1
In this paper, we study a set of combinatorial optimization problems on weighted graphs: the shortest path problem with negative weights, the weighted perfect bipartite matching pr…