6 citations · 17 across the 7 of their papers we have counts for
3 papers · 1 filter
Identifying Correlated Heavy-Hitters in a Two-Dimensional Data Stream
Bibudh Lahiri, Arko Provo Mukherjee, Srikanta Tirthapura
We consider online mining of correlated heavy-hitters from a data stream. Given a stream of two-dimensional data, a correlated aggregate query first extracts a substream by applyin…
Mining Maximal Cliques from an Uncertain Graph
Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura
We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs. For parameter 0 < α < 1, we…
Parallel Triangle Counting in Massive Streaming Graphs
Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura
The number of triangles in a graph is a fundamental metric, used in social network analysis, link classification and recommendation, and more. Driven by these applications and the…