Zengfeng Huang

According to our database1, Zengfeng Huang authored at least 23 papers between 2011 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


SCE: Scalable Network Embedding from Sparsest Cut.
CoRR, 2020

Personalized PageRank to a Target Node, Revisited.
CoRR, 2020

Joint Representation Learning of Legislator and Legislation for Roll Call Prediction.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices.
J. Mach. Learn. Res., 2019

Higher-order Weighted Graph Convolutional Networks.
CoRR, 2019

Dynamic Self-training Framework for Graph Convolutional Networks.
CoRR, 2019

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.
Algorithmica, 2019

Dynamic Graph Stream Algorithms in o(n) Space.
Algorithmica, 2019

Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information.
CoRR, 2018

Top-k spatial-keyword publish/subscribe over sliding window.
VLDB J., 2017

The Communication Complexity of Distributed epsilon-Approximations.
SIAM J. Comput., 2017

Communication complexity of approximate maximum matching in the message-passing model.
CoRR, 2017

Efficient Matrix Sketching over Distributed Data.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Tracking Matrix Approximation over Distributed Sliding Windows.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window.
Proc. VLDB Endow., 2016

Clairvoyant Mechanisms for Online Auctions.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Communication Complexity of Approximate Matching in Distributed Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Tracking the Frequency Moments at All Times.
CoRR, 2014

Mergeable summaries.
ACM Trans. Database Syst., 2013

Sampling based algorithms for quantile computation in sensor networks.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Optimal sampling algorithms for frequency estimation in distributed data.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011