3 citations · 6 across the 3 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Fast Sketch-based Recovery of Correlation Outliers
Graham Cormode, Jacques Dark
Many data sources can be interpreted as time-series, and a key problem is to identify which pairs out of a large collection of signals are highly correlated. We expect that there w…
cs.DS2017★ 3 cited
Independent Set Size Approximation in Graph Streams
Graham Cormode, Jacques Dark, Christian Konrad
We study the problem of estimating the size of independent sets in a graph defined by a stream of edges. Our approach relies on the Caro-Wei bound, which expresses the desired…