6 citations · 17 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013★ 5 cited
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…
cs.DS2010★ 1 cited
A Streaming Approximation Algorithm for Klee's Measure Problem
Gokarna Sharma, Costas Busch, Srikanta Tirthapura
The efficient estimation of frequency moments of a data stream in one-pass using limited space and time per item is one of the most fundamental problem in data stream processing. A…