59 citations · 213 across the 21 of their papers we have counts for
4 papers · 1 filter
Approximate Furthest Neighbor with Application to Annulus Query
Rasmus Pagh, Francesco Silvestri, Johan Sivertsen +1
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries…
The LP-Newton Method and Conic Optimization
Francesco Silvestri, Gerhard Reinelt
We propose that the LP-Newton method can be used to solve conic LPs over a conic box, whenever linear optimization over an otherwise unconstrained conic box is easy. In particular,…
Symmetry-free SDP Relaxations for Affine Subspace Clustering
Francesco Silvestri, Gerhard Reinelt, Christoph Schnörr
We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While ther…
Distance Sensitive Bloom Filters Without False Negatives
Mayank Goswami, Rasmus Pagh, Francesco Silvestri +1
A Bloom filter is a widely used data-structure for representing a set and answering queries of the form "Is in ?". By allowing some false positive answers (saying "yes"…