Yanhao Wang

Proceedings of the Proceedings 27th International Conference on Extending Database Technology, 2024

2023

SID-TGAN: A Transformer-Based Generative Adversarial Network for Sonar Image Despeckling.

[BibT_eX]

[DOI]

Remote. Sens., October, 2023

Fair Max-Min Diversity Maximization in Streaming and Sliding-Window Models.

[BibT_eX]

[DOI]

Entropy, July, 2023

Continuous k-Regret Minimization Queries: A Dynamic Coreset Approach.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., June, 2023

FAFEnet: A fast and accurate model for automatic license plate detection and recognition.

[BibT_eX]

[DOI]

IET Image Process., February, 2023

Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Workload-aware and Learned Z-Indexes.

[BibT_eX]

[DOI]

Sachith Pai

CoRR, 2023

Opinion-aware Influence Maximization in Online Social Networks.

[BibT_eX]

[DOI]

Ying Wang

CoRR, 2023

Graph Summarization via Node Grouping: A Spectral Algorithm.

[BibT_eX]

[DOI]

Arpit Merchant

Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Spectral Normalized-Cut Graph Partitioning with Fairness Constraints.

[BibT_eX]

[DOI]

Jia Li

Arpit Merchant

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

A Customized Text Sanitization Mechanism with Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics: ACL 2023, 2023

SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search.

[BibT_eX]

[DOI]

Qiang Huang

Anthony K. H. Tung

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Improved Algorithm for Regret Ratio Minimization in Multi-Objective Submodular Maximization.

[BibT_eX]

[DOI]

Jiping Zheng

Fanxu Meng

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Happiness Maximizing Sets under Group Fairness Constraints.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams.

[BibT_eX]

[DOI]

CoRR, 2022

Balancing Utility and Fairness in Submodular Maximization (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2022

Happiness Maximizing Sets under Group Fairness Constraints (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2022

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways.

[BibT_eX]

[DOI]

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Streaming Algorithms for Diversity Maximization with Fairness Constraints.

[BibT_eX]

[DOI]

Francesco Fabbri

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Robustness of Sketched Linear Classifiers to Adversarial Attacks.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021

A survey of typical attributed graph queries.

[BibT_eX]

[DOI]

World Wide Web, 2021

Fair and Representative Subset Selection from Data Streams.

[BibT_eX]

[DOI]

Francesco Fabbri

Proceedings of the WWW '21: The Web Conference 2021, 2021

Minimum Coresets for Maxima Representation of Multidimensional Data.

[BibT_eX]

[DOI]

Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

A Fully Dynamic Algorithm for k-Regret Minimizing Sets.

[BibT_eX]

[DOI]

Raymond Chi-Wing Wong

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

2020

Streaming Submodular Maximization with Fairness Constraints.

[BibT_eX]

[DOI]

Francesco Fabbri

CoRR, 2020

Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2020

GRMR: Generalized Regret-Minimizing Representatives.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Sampling Algorithms for Approximate Temporal Motif Counting.

[BibT_eX]

[DOI]

Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019

Efficient Representative Subset Selection over Sliding Windows.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

Coresets for Minimum Enclosing Balls over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Semantic and Influence aware k-Representative Queries over Social Streams.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2019

2018

Location-aware Influence Maximization over Dynamic Social Streams.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2018

Influence Maximization on Social Graphs: A Survey.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2018

River: A Real-Time Influence Monitoring System on Social Media Streams.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Conference on Data Mining Workshops, 2018

A Sliding-Window Framework for Representative Subset Selection.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017

Real-Time Influence Maximization on Dynamic Social Streams.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Efficient Streaming Algorithms for Submodular Maximization with Multi-Knapsack Constraints.

[BibT_eX]

[DOI]