19 citations · 22 across the 4 of their papers we have counts for
4 papers
Efficient Similarity Search in Dynamic Data Streams
Marc Bury, Chris Schwiegelshohn, Mara Sorella
The Jaccard index is an important similarity measure for item sets and Boolean data. On large datasets, an exact similarity computation is often infeasible for all item pairs both…
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
Marc Bury, Chris Schwiegelshohn
This paper presents an algorithm for estimating the weight of a maximum weighted matching by augmenting any estimation routine for the size of an unweighted matching. The algorithm…
OBDDs and (Almost) -wise Independent Random Variables
Marc Bury
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph which is represented by an OBDD and solve optimization problems by mainly…
Random Projections for k-Means: Maintaining Coresets Beyond Merge & Reduce
Marc Bury, Chris Schwiegelshohn
We give a new construction for a small space summary satisfying the coreset guarantee of a data set with respect to the -means objective function. The number of points required…