3 citations · 3 across the 4 of their papers we have counts for
5 papers
The SpaceSaving Family of Algorithms for Data Streams with Bounded Deletions
Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi +3
In this paper, we present an advanced analysis of near optimal algorithms that use limited space to solve the frequency estimation, heavy hitters, frequent items, and top-k approxi…
The content correlation of multiple streaming edges
Michel de Rougemont, Guillaume Vimont
We study how to detect clusters in a graph defined by a stream of edges, without storing the entire graph. We extend the approach to dynamic graphs defined by the most recent edges…
Approximate Integration of streaming data
Michel de Rougemont, Guillaume Vimont
We approximate analytic queries on streaming data with a weighted reservoir sampling. For a stream of tuples of a Datawarehouse we show how to approximate some OLAP queries. For a…
Some approximations in Model Checking and Testing
M. C. Gaudel, R. Lassaigne, F. Magniez +1
Model checking and testing are two areas with a similar goal: to verify that a system satisfies a property. They start with different hypothesis on the systems and develop many tec…
The complexity of approximate Nash equilibrium in congestion games with negative delays
Frederic Magniez, Michel de Rougemont, Miklos Santha +1
We extend the study of the complexity of finding an $\eps$-approximate Nash equilibrium in congestion games from the case of positive delay functions to delays of arbitrary sign. W…