Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 33 for “"Approximate Nearest Neighbor Search"”.
-
Approximate Nearest Neighbor Search with Filters
Approximate nearest neighbor search (ANNS) on high-dimensional vectors is a fundamental primitive used widely for search over neural embeddings of unstructured data. Prior work on ANNS has produced indices which provide fast and accurate search on datasets up to billions of points, but are not well …
-
New paradigms for approximate nearest-neighbor search
Nearest-neighbor search is a very natural and universal problem in computer science. Often times, the problem size necessitates approximation. In this thesis, I present new paradigms for nearest-neighbor search (along with new algorithms and theory in these paradigms) that make nearest-neighbor …
-
Near Memory Accelerators for Approximate Nearest Neighbor Search
Approximate Nearest Neighbor (ANN) search has become a critical component in modern retrieval systems, supporting applications such as recommendation engines, semantic search, and large language models. Despite the effectiveness of embedding-based methods, performing ANN search over billion-scale, …
-
Exploiting the structure of the data in approximate nearest neighbor search
Η εύρεση του πλησιέστερου γείτονα είναι ένα καίριο πρόβλημα με πολλές σημαντικές εφαρμογές. Για να επιταχύνουμε το χρόνο εύρεσης του κοντινότερου γείτονα εκμεταλλευόμαστε το ότι πολλές φορές τα δεδομένα ακολουθούν μη τυχαία πρότυπα. Συγκεκριμένα, υποθέτουμε ότι τα σημεία που δεχόμαστε ως είσοδο …
-
Improving approximate nearest neighbor search in HNSW graphs with data clustering
Exhaustive strategies for search and information retrieval tasks over vector databases do not meet the runtime efficiency expectations of modern applications. Approximate Near- est Neighbor Search (ANNS) algorithms use different indexing and searching techniques to perform an approximate similarity …
-
Unsupervised binary code learning for approximate nearest neighbor search in large-scale datasets
Nearest neighbor search is an important operation whose goal is to find items in the dataset that are similar to a given query. It has a number of applications such as content based image retrieval (CBIR), near duplicate image detection and recommender systems. With the rapid development of the …
-
Approximate Nearest Neighbor Search for Multiple Distance Metrics: Algorithms, Index Structures, and Applications
Approximate nearest neighbor search (ANNS) is a fundamental problem in information retrieval, recommendation, computer vision, machine learning, and vector databases. Although locality-sensitive hashing (LSH) and graph indexes provide effective solutions for standard metrics, high-dimensional …
-
Dynamic Kernel Density Estimation using Approximate Nearest Neighbor Search - A Dynamic Extension of the DEANN Algorithm
… this cost in the static setting by combining approximate nearest neighbor search with random sampling, but assumes that the dataset is fixed after preprocessing. This thesis extends DEANN to a dynamic setting where points can be inserted and deleted. The implemented Dynamic ANN Estimator (DAE) …
-
Scalable Approximate Nearest Neighbor Search for High-Dimensional Deep Descriptor Retrieval with Applications in Scientific Imaging and Multi-Modal Data Analysis
Efficient similarity search in large-scale, high-dimensional deep descriptor spaces is a fundamental problem in computer science, with applications across computer vision, computational biology, materials informatics, and recommender systems. Existing Approximate Nearest Neighbor Search (ANNS) …
-
MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbour Search
Approximate nearest neighbor search (ANNS) on high dimensional vectors is important for numerous applications, such as search engines, recommendation systems, and more recently, large language models (LLMs), where Retrieval Augmented Generation (RAG) is used to add context to an LLM query. …
-
Deep Hashing for Image Similarity Search
Hashing for similarity search is one of the most widely used methods to solve the approximate nearest neighbor search problem. In this method, one first maps data items from a real valued high-dimensional space to a suitable low dimensional binary code space and then performs the approximate …
-
HNSW grafų algoritmas apytikslio artimiausio kaimyno paieškai /
… HNSW algorithm and its potential applications in approximate nearest neighbor search tasks.
-
Identification of spatial patterns in spatially resolved multi-omics
… datasets using sparse matrix operations and approximate nearest neighbor search. Finally, we introduce a Statistical Tool for Analysis of Multi-omics Patterns (STAMPs) for the SVF detection on spatially resolved multi-omics that enables power analysis and implement cell type information. …
-
Τεχνικές ομαδοποίησης και κοντινότερου γείτονα για οπτική αναζήτηση εικόνων
… are emerging every day and visual image search is therefore becoming increasingly important. In this thesis we propose clustering- and nearest neighbor-based improvements for visual image search. Clustering is either performed on feature space or on image space, i.e. on high-dimensional …
-
Towards large-scale nonparametric scene parsing of images and video
… parsing framework is built on nonparametric search-based label transfer instead of discriminative classification. We formulate exemplar-based scene parsing for both 2D (from images) and 3D (from video), and demonstrate accurate labelling on standard benchmarks. Since our framework is …
-
Towards efficient and secure AI: Nearest Neighbor Algorithms for transformers and adversarial robustness
This thesis explores Nearest Neighbor Algorithms across diverse areas of Machine Learning and Theoretical Computer Science. First, it advances the theoretical understanding of Sparse Transformer architectures that leverage k Nearest Neighbor primitives. Second, it introduces novel algorithms to …
-
MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE
… in this work. These algorithms include exact and approximate scalable massively parallel image descriptors for descriptor computing, parallel construction of k-dimensional tree (KD-tree) and the forest of KD-trees for descriptor indexing, parallel approximate nearest neighbor search (ANNS) and …
-
METHODS TO IMPROVE EFFICIENCY, SENSITIVITY, AND SELECTIVITY OF SEQUENCE SIMILARITY SEARCH
… of this analysis, sequence similarity search, is hampered by three main obstacles: sensitivity in detecting distant evolutionary relationships, selectivity in distinguishing true homology from spurious similarity caused by features like tandem repeats, and scalability to handle massive …
-
METHODS TO IMPROVE EFFICIENCY, SENSITIVITY, AND SELECTIVITY OF SEQUENCE SIMILARITY SEARCH
… of this analysis, sequence similarity search, is hampered by three main obstacles: sensitivity in detecting distant evolutionary relationships, selectivity in distinguishing true homology from spurious similarity caused by features like tandem repeats, and scalability to handle massive …
Page 1 of 2