default search action
Yanhao Wang 0001
Person information
- affiliation (since 2021): East China Normal University, Shanghai, China
- affiliation (2020-2021): University of Helsinki, Department of Computer Science, Finland
- affiliation (2016-2020): National University of Singapore, Singapore
- affiliation (2011-2014): Renmin University of China, Beijing, China
Other persons with the same name
- Yanhao Wang — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Yanhao Wang
, Tianchen Zhou
Federated Submodular Maximization With Differential Privacy. IEEE Internet Things J. 11(2): 1827-1839 (2024) - [j15]Wu Sun, Hui Li, Qingqing Liang, Xiaofeng Zou, Mei Chen, Yanhao Wang
On data efficiency of univariate time series anomaly detection models. J. Big Data 11(1): 83 (2024) - [j14]Xin Zhou
Multi-level feature enhancement network for object detection in sonar images. J. Vis. Commun. Image Represent. 100: 104147 (2024) - [j13]Yiqun Sun, Qiang Huang, Yanhao Wang, Anthony K. H. Tung:
DiversiNews: Enriching News Consumption with Relevant yet Diverse News Articles Retrieval. Proc. VLDB Endow. 17(12): 4277-4280 (2024) - [j12]Jiping Zheng
Hybrid Regret Minimization: A Submodular Approach. IEEE Trans. Knowl. Data Eng. 36(7): 3151-3165 (2024) - [j11]Adriano Fazzone, Yanhao Wang, Francesco Bonchi:
Fair Representation in Submodular Subset Selection: A Pareto Optimization Approach. Trans. Mach. Learn. Res. 2024 (2024) - [c28]Ruien Li
Coresets for Deletion-Robust k-Center Clustering. CIKM 2024: 3877-3881 - [c27]Huimin Chen, Chengyu Wang, Yanhao Wang, Cen Chen, Yinggui Wang:
TaiChi: Improving the Robustness of NLP Models by Seeking Common Ground While Reserving Differences. LREC/COLING 2024: 15542-15551 - [c26]Yanhao Wang
Balancing Utility and Fairness in Submodular Maximization. EDBT 2024: 1-14 - [c25]Sachith Pai, Michael Mathioudakis
WaZI: A Learned and Workload-aware Z-Index. EDBT 2024: 559-571 - [c24]Yudong Niu, Yuchen Li
Discovering Personalized Characteristic Communities in Attributed Graphs. ICDE 2024: 2834-2847 - [c23]Jiping Zheng, Fanxu Meng, Yanhao Wang, Xiaoyang Wang, Sheng Wang, Yuan Ma, Zhiyang Hao:
Hybrid Regret Minimization: A Submodular Approach (Extended Abstract). ICDE 2024: 5701-5702 - [c22]Yiping Wang
DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows. KDD 2024: 3255-3266 - [c21]Hanhua Xiao
How to Avoid Jumping to Conclusions: Measuring the Robustness of Outstanding Facts in Knowledge Graphs. KDD 2024: 3539-3550 - [i22]Qiang Huang
Diversity-Aware k-Maximum Inner Product Search Revisited. CoRR abs/2402.13858 (2024) - [i21]Yiping Wang, Yanhao Wang, Cen Chen:
DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows (Technical Report). CoRR abs/2406.07953 (2024) - 2023
- [j10]Yanhao Wang
Fair Max-Min Diversity Maximization in Streaming and Sliding-Window Models. Entropy 25(7): 1066 (2023) - [j9]Xin Zhou, Yao Cheng, Liling Jiang, Bo Ning, Yanhao Wang
FAFEnet: A fast and accurate model for automatic license plate detection and recognition. IET Image Process. 17(3): 807-818 (2023) - [j8]Xin Zhou
SID-TGAN: A Transformer-Based Generative Adversarial Network for Sonar Image Despeckling. Remote. Sens. 15(20): 5072 (2023) - [j7]Jiping Zheng
Continuous k-Regret Minimization Queries: A Dynamic Coreset Approach. IEEE Trans. Knowl. Data Eng. 35(6): 5680-5694 (2023) - [c20]Qiang Huang
SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search. AAAI 2023: 4312-4321 - [c19]Yanhao Wang
Improved Algorithm for Regret Ratio Minimization in Multi-Objective Submodular Maximization. AAAI 2023: 12500-12508 - [c18]Sai Chen, Fengran Mo, Yanhao Wang
A Customized Text Sanitization Mechanism with Differential Privacy. ACL (Findings) 2023: 5747-5758 - [c17]Ying Wang, Yanhao Wang
Opinion-aware Influence Maximization in Online Social Networks. DSIT 2023: 214-221 - [c16]Jia Li, Yanhao Wang
Spectral Normalized-Cut Graph Partitioning with Fairness Constraints. ECAI 2023: 1389-1397 - [c15]Francesco Fabbri, Yanhao Wang
Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways (Extended Abstract). IJCAI 2023: 6431-6435 - [c14]Yanhao Wang
Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms. SDM 2023: 91-99 - [c13]Arpit Merchant
Graph Summarization via Node Grouping: A Spectral Algorithm. WSDM 2023: 742-750 - [i20]Yanhao Wang
Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms. CoRR abs/2301.02053 (2023) - [i19]Ying Wang, Yanhao Wang
Opinion-aware Influence Maximization in Online Social Networks. CoRR abs/2301.11527 (2023) - [i18]Jia Li, Yanhao Wang
Spectral Normalized-Cut Graph Partitioning with Fairness Constraints. CoRR abs/2307.12065 (2023) - [i17]Sachith Pai, Michael Mathioudakis, Yanhao Wang:
Workload-aware and Learned Z-Indexes. CoRR abs/2310.04268 (2023) - [i16]Jiaxi Pu, Yanhao Wang, Yuchen Li, Xuan Zhou:
Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs. CoRR abs/2310.11886 (2023) - 2022
- [j6]Jiping Zheng
Happiness Maximizing Sets under Group Fairness Constraints. Proc. VLDB Endow. 16(2): 291-303 (2022) - [c12]Ananth Mahadevan
Robustness of Sketched Linear Classifiers to Adversarial Attacks. CIKM 2022: 4319-4323 - [c11]Yanhao Wang
Streaming Algorithms for Diversity Maximization with Fairness Constraints. ICDE 2022: 41-53 - [c10]Francesco Fabbri, Yanhao Wang
Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways. WWW 2022: 2719-2728 - [i15]Francesco Fabbri, Yanhao Wang, Francesco Bonchi, Carlos Castillo, Michael Mathioudakis:
Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways. CoRR abs/2202.00640 (2022) - [i14]Yanhao Wang
Streaming Algorithms for Diversity Maximization with Fairness Constraints. CoRR abs/2208.00194 (2022) - [i13]Jiping Zheng
Happiness Maximizing Sets under Group Fairness Constraints (Technical Report). CoRR abs/2208.06553 (2022) - [i12]Yanhao Wang, Yuchen Li, Francesco Bonchi, Ying Wang:
Balancing Utility and Fairness in Submodular Maximization (Technical Report). CoRR abs/2211.00980 (2022) - [i11]Arpit Merchant, Michael Mathioudakis, Yanhao Wang
Graph Summarization via Node Grouping: A Spectral Algorithm. CoRR abs/2211.04169 (2022) - [i10]Jingjing Wang, Yanhao Wang
Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams. CoRR abs/2211.12101 (2022) - [i9]Qiang Huang
SAH: Shifting-aware Asymmetric Hashing for Reverse k-Maximum Inner Product Search. CoRR abs/2211.12751 (2022) - 2021
- [j5]Yanhao Wang
A survey of typical attributed graph queries. World Wide Web 24(1): 297-346 (2021) - [c9]Yanhao Wang
A Fully Dynamic Algorithm for k-Regret Minimizing Sets. ICDE 2021: 1631-1642 - [c8]Yanhao Wang
Minimum Coresets for Maxima Representation of Multidimensional Data. PODS 2021: 138-152 - [c7]Yanhao Wang
Fair and Representative Subset Selection from Data Streams. WWW 2021: 1340-1350 - 2020
- [c6]Jingjing Wang, Yanhao Wang
Efficient Sampling Algorithms for Approximate Temporal Motif Counting. CIKM 2020: 1505-1514 - [i8]Yanhao Wang
A Fully Dynamic Algorithm for k-Regret Minimizing Sets. CoRR abs/2005.14493 (2020) - [i7]Yanhao Wang
GRMR: Generalized Regret-Minimizing Representatives. CoRR abs/2007.09634 (2020) - [i6]Jingjing Wang, Yanhao Wang
Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version). CoRR abs/2007.14028 (2020) - [i5]Yanhao Wang
Streaming Submodular Maximization with Fairness Constraints. CoRR abs/2010.04412 (2020)
2010 – 2019
- 2019
- [j4]Yanhao Wang
Efficient Representative Subset Selection over Sliding Windows. IEEE Trans. Knowl. Data Eng. 31(7): 1327-1340 (2019) - [c5]Yanhao Wang
Semantic and Influence aware k-Representative Queries over Social Streams. EDBT 2019: 181-192 - [c4]Yanhao Wang
Coresets for Minimum Enclosing Balls over Sliding Windows. KDD 2019: 314-323 - [i4]Yanhao Wang, Yuchen Li, Kian-Lee Tan:
Semantic and Influence aware k-Representative Queries over Social Streams. CoRR abs/1901.10109 (2019) - [i3]Yanhao Wang, Yuchen Li, Kian-Lee Tan:
Coresets for Minimum Enclosing Balls over Sliding Windows. CoRR abs/1905.03718 (2019) - 2018
- [j3]Yuchen Li
Influence Maximization on Social Graphs: A Survey. IEEE Trans. Knowl. Data Eng. 30(10): 1852-1872 (2018) - [j2]Yanhao Wang
Location-aware Influence Maximization over Dynamic Social Streams. ACM Trans. Inf. Syst. 36(4): 43:1-43:35 (2018) - [c3]Yanhao Wang
A Sliding-Window Framework for Representative Subset Selection. ICDE 2018: 1268-1271 - [c2]Mo Sha, Yuchen Li, Yanhao Wang
River: A Real-Time Influence Monitoring System on Social Media Streams. ICDM Workshops 2018: 1429-1434 - 2017
- [j1]Yanhao Wang
Real-Time Influence Maximization on Dynamic Social Streams. Proc. VLDB Endow. 10(7): 805-816 (2017) - [i2]Yanhao Wang, Qi Fan, Yuchen Li, Kian-Lee Tan:
Real-Time Influence Maximization on Dynamic Social Streams. CoRR abs/1702.01586 (2017) - [i1]Yanhao Wang, Yuchen Li, Kian-Lee Tan:
Efficient Streaming Algorithms for Submodular Maximization with Multi-Knapsack Constraints. CoRR abs/1706.04764 (2017) - 2013
- [c1]Xin Zhou, Xiao Zhang, Yanhao Wang
Efficient Distributed Multi-dimensional Index for Big Data Management. WAIM 2013: 130-141
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-22 19:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: