1 citations · 2 across the 8 of their papers we have counts for
7 papers · 1 filter
PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees
Jiuqi Wei, Xiaodong Lee, Botao Peng +3
Locality-sensitive hashing (LSH) is a well-known solution for approximate nearest neighbor (ANN) search with theoretical guarantees. Traditional LSH-based methods mainly focus on i…
DaiSy: A Library for Scalable Data Series Similarity Search
Francesca Del Gaudio, Manos Chatzakis, Gayathiri Ravendirane +2
Exact similarity search over large collections of data series is a fundamental operation in modern applications, yet existing solutions are often fragmented, specialized, or tailor…
Fast and Exact Similarity Search in less than a Blink of an Eye
Patrick Schäfer, Jakob Brand, Ulf Leser +2
Similarity search is a fundamental operation for analyzing data series (DS), which are ordered sequences of real values. To enhance efficiency, summarization techniques are employe…
Fast Data Series Indexing for In-Memory Data
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deli…
Data Series Indexing Gone Parallel
Botao Peng
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deli…
MESSI: In-Memory Data Series Indexing
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deli…