Author of the publication

Erasable Virtual HyperLogLog for Approximating Cumulative Distribution over Data Streams.

, , , , , and . IEEE Trans. Knowl. Data Eng., 34 (11): 5336-5350 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficiently Estimating Subgraph Statistics of Large Networks in the Dark., , , , , and . CoRR, (2013)Minfer: Inferring Motif Statistics From Sampled Edges., , and . CoRR, (2015)A Peep on the Interplays between Online Video Websites and Online Social Networks, , , , and . CoRR, (2013)Design of Efficient Sampling Methods on Hybrid Social-Affiliation Networks., , , , and . CoRR, (2014)SNOD: a fast sampling method of exploring node orbit degrees for large graphs., , , , and . Knowl. Inf. Syst., 61 (1): 301-326 (2019)Detecting a Variety of Long-Term Stealthy User Behaviors on High Speed Links., , , and . IEEE Trans. Knowl. Data Eng., 31 (10): 1912-1925 (2019)Continuously Distinct Sampling over Centralized and Distributed High Speed Data Streams., , , , and . IEEE Trans. Parallel Distributed Syst., 30 (2): 300-314 (2019)I/O-efficient calculation of H-group closeness centrality over disk-resident graphs., , , , and . Inf. Sci., (2017)Unbiased Characterization of Node Pairs over Large Graphs., , , , and . ACM Trans. Knowl. Discov. Data, 9 (3): 22:1-22:27 (2015)Efficiently Estimating Motif Statistics of Large Networks., , , , , and . ACM Trans. Knowl. Discov. Data, 9 (2): 8:1-8:27 (2014)