Остановите войну!
for scientists:
default search action
Anthony K. H. Tung
- > Home > Persons > Anthony K. H. Tung
Publications
- 2024
- [i17]Qiang Huang, Yanhao Wang, Yiqun Sun, Anthony Kum Hoe Tung:
Diversity-Aware k-Maximum Inner Product Search Revisited. CoRR abs/2402.13858 (2024) - [i16]Yifan Bao, Yihao Ang, Qiang Huang, Anthony K. H. Tung, Zhiyong Huang:
Towards Controllable Time Series Generation. CoRR abs/2403.03698 (2024) - 2023
- [j51]Qiang Huang, Pingyi Luo, Anthony K. H. Tung:
A New Sparse Data Clustering Method Based On Frequent Items. Proc. ACM Manag. Data 1(1): 5:1-5:28 (2023) - [j50]Yihao Ang, Qiang Huang, Yifan Bao, Anthony K. H. Tung, Zhiyong Huang:
TSGBench: Time Series Generation Benchmark. Proc. VLDB Endow. 17(3): 305-318 (2023) - [c111]Qiang Huang, Yanhao Wang, Anthony K. H. Tung:
SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search. AAAI 2023: 4312-4321 - [c110]Qiang Huang, Anthony K. H. Tung:
Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search. ICDE 2023: 436-449 - [c109]Yihao Ang, Qiang Huang, Anthony K. H. Tung, Zhiyong Huang:
A Stitch in Time Saves Nine: Enabling Early Anomaly Detection with Correlation Analysis. ICDE 2023: 1832-145 - [i15]Qiang Huang, Anthony K. H. Tung:
Lightweight-Yet-Efficient: Revitalizing Ball-Tree for Point-to-Hyperplane Nearest Neighbor Search. CoRR abs/2302.10626 (2023) - [i14]Yihao Ang, Qiang Huang, Yifan Bao, Anthony K. H. Tung, Zhiyong Huang:
TSGBench: Time Series Generation Benchmark. CoRR abs/2309.03755 (2023) - [i13]Biao Wu, Qiang Huang, Anthony K. H. Tung:
From Zero to Hero: Detecting Leaked Data through Synthetic Data Injection and Model Querying. CoRR abs/2310.04145 (2023) - 2022
- [c105]Yifan Lei, Qiang Huang, Mohan S. Kankanhalli, Anthony K. H. Tung:
DIOT: Detecting Implicit Obstacles from Trajectories. DASFAA (1) 2022: 232-240 - [i12]Yifan Lei, Qiang Huang, Mohan S. Kankanhalli, Anthony K. H. Tung:
DIOT: Detecting Implicit Obstacles from Trajectories. CoRR abs/2202.11016 (2022) - [i10]Qiang Huang, Yanhao Wang, Anthony K. H. Tung:
SAH: Shifting-aware Asymmetric Hashing for Reverse k-Maximum Inner Product Search. CoRR abs/2211.12751 (2022) - 2021
- [c101]Qiang Huang, Yifan Lei, Anthony K. H. Tung:
Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere. SIGMOD Conference 2021: 777-789 - [i8]Pingyi Luo, Qiang Huang, Anthony K. H. Tung:
A Generic Distributed Clustering Framework for Massive Data. CoRR abs/2106.10515 (2021) - 2020
- [c99]Yifan Lei, Qiang Huang, Mohan S. Kankanhalli, Anthony K. H. Tung:
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring. SIGMOD Conference 2020: 2589-2599 - [i5]Yifan Lei, Qiang Huang, Mohan S. Kankanhalli, Anthony K. H. Tung:
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring. CoRR abs/2004.05345 (2020) - 2019
- [c96]Yifan Lei, Qiang Huang, Mohan S. Kankanhalli, Anthony K. H. Tung:
Sublinear Time Nearest Neighbor Search over Generalized Weighted Space. ICML 2019: 3773-3781 - 2018
- [c93]Qiang Huang, Guihong Ma, Jianlin Feng, Qiong Fang, Anthony K. H. Tung:
Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search. KDD 2018: 1561-1570
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-05-09 00:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint