J Song, Y Yang, Y Yang, Z Huang… - Proceedings of the 2013 …, 2013 - dl.acm.org
In this paper, we present a new multimedia retrieval paradigm to innovate large-scale search of heterogenous multimedia data. It is able to return results of different media types …
M Li, YG Wang, P Zhang, H Wang, L Fan… - … on Knowledge and …, 2022 - ieeexplore.ieee.org
Approximate nearest neighbour search (ANNS) in high-dimensional space is an essential and fundamental operation in many applications from many domains such as multimedia …
Q Huang, J Feng, Y Zhang, Q Fang, W Ng - Proceedings of the VLDB …, 2015 - dl.acm.org
Locality-Sensitive Hashing (LSH) and its variants are the well-known indexing schemes for the c-Approximate Nearest Neighbor (c-ANN) search problem in high-dimensional …
Near-duplicate video retrieval (NDVR) has recently attracted much research attention due to the exponential growth of online videos. It has many applications, such as copyright …
A Sriraman, TF Wenisch - … Symposium on Operating Systems Design and …, 2018 - usenix.org
Modern On-Line Data Intensive (OLDI) applications have evolved from monolithic systems to instead comprise numerous, distributed microservices interacting via Remote Procedure …
A Sriraman, TF Wenisch - 2018 ieee international symposium …, 2018 - ieeexplore.ieee.org
Modern On-Line Data Intensive (OLDI) applications have evolved from monolithic systems to instead comprise numerous, distributed microservices interacting via Remote Procedure …
J Gan, J Feng, Q Fang, W Ng - Proceedings of the 2012 ACM SIGMOD …, 2012 - dl.acm.org
Locality-Sensitive Hashing (LSH) and its variants are well-known methods for solving the c- approximate NN Search problem in high-dimensional space. Traditionally, several LSH …
Data series are a special type of multidimensional data present in numerous domains, where similarity search is a key operation that has been extensively studied in the data …
Nearest neighbor searches in high-dimensional space have many important applications in domains such as data mining, and multimedia databases. The problem is challenging due to …