17 citations · 45 across the 9 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2017★ 2 cited
On fast bounded locality sensitive hashing
Piotr Wygocki
In this paper, we examine the hash functions expressed as scalar products, i.e., , for some bounded random vector . Such hash functions have numerous applications, b…
cs.DS2016★ 7 cited
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 …
cs.DS2014★ 6 cited
Approximation Algorithms for Steiner Tree Problems Based on Universal Solution Frameworks
Krzysztof Ciebiera, Piotr Godlewski, Piotr Sankowski +1
This paper summarizes the work on implementing few solutions for the Steiner Tree problem which we undertook in the PAAL project. The main focus of the project is the development o…