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 55 for “"Approximate nearest neighbor"”.

  1. 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 …

    maryland Repository record for Approximate Nearest Neighbor Search with Filters (opens in a new tab)

  2. 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 …

    gatech Repository record for New paradigms for approximate nearest-neighbor search (opens in a new tab)

  3. 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, …

    mtu Repository record for Near Memory Accelerators for Approximate Nearest Neighbor Search (opens in a new tab)

  4. Implementing approximate voronoi diagrams for approximate nearest neighbor searching

    Η αναζήτηση πλησιέστερου γείτονα είναι ένα θεμελιώδες πρόβλημα στην Επιστήμη των Υπολογιστών. Ένα άπο τα κύρια θεωρητικά ζητήματα ειναι η εξισορρόπηση του χρόνου που απαιτείται για να απαντήσει η δομή σε ερωτήματα και η χωρική πολυπλοκότητά της: η πρόσφατη μελέτη στο Προσεγγιστικό Διάγραμμα …

    athens Repository record for Implementing approximate voronoi diagrams for approximate nearest neighbor searching (opens in a new tab)

  5. Low-quality dimension reduction and high-dimensional Approximate Nearest Neighbor

    Το πρόβλημα του προσεγγιστικού κοντινότερου γείτονα στην Ευκλείδεια μετρική έχει επιλυθεί κυρίως με δύο βασικές μεθόδους: δομές δέντρων που διαμερίζουν τον χώρο, οι οποίες λειτουργούν εξαιρετικά όταν η διάσταση είναι σχετικά μικρή και το locality sensitive hashing το οποίο αποτελεί μια …

    athens Repository record for Low-quality dimension reduction and high-dimensional Approximate Nearest Neighbor (opens in a new tab)

  6. Exploiting the structure of the data in approximate nearest neighbor search

    Η εύρεση του πλησιέστερου γείτονα είναι ένα καίριο πρόβλημα με πολλές σημαντικές εφαρμογές. Για να επιταχύνουμε το χρόνο εύρεσης του κοντινότερου γείτονα εκμεταλλευόμαστε το ότι πολλές φορές τα δεδομένα ακολουθούν μη τυχαία πρότυπα. Συγκεκριμένα, υποθέτουμε ότι τα σημεία που δεχόμαστε ως είσοδο …

    athens Repository record for Exploiting the structure of the data in approximate nearest neighbor search (opens in a new tab)

  7. Improving approximate nearest neighbor search in HNSW graphs with data clustering

    … efficiency expectations of modern applications. Approximate Near- est Neighbor Search (ANNS) algorithms use different indexing and searching techniques to perform an approximate similarity search, drastically reducing runtime in exchange for the lack of an optimality guarantee. A usual strategy …

    brazil-ufrgs Repository record for Improving approximate nearest neighbor search in HNSW graphs with data clustering (opens in a new tab)

  8. 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 …

    colostate Repository record for Unsupervised binary code learning for approximate nearest neighbor search in large-scale datasets (opens in a new tab)

  9. 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 …

    gatech Repository record for Approximate Nearest Neighbor Search for Multiple Distance Metrics: Algorithms, Index Structures, and Applications (opens in a new tab)

  10. 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) …

    chalmers Repository record for Dynamic Kernel Density Estimation using Approximate Nearest Neighbor Search - A Dynamic Extension of the DEANN Algorithm (opens in a new tab)

  11. Scalable Approximate Nearest Neighbor Search for High-Dimensional Deep Descriptor Retrieval with Applications in Scientific Imaging and Multi-Modal Data Analysis

    … informatics, and recommender systems. Existing Approximate Nearest Neighbor Search (ANNS) methods, including HNSW, DiskANN, and SPANN, exhibit trade-offs between recall, latency, memory footprint, and index adaptability. Graph-based approaches incur substantial memory overhead and limited …

    texas-state Repository record for Scalable Approximate Nearest Neighbor Search for High-Dimensional Deep Descriptor Retrieval with Applications in Scientific Imaging and Multi-Modal Data Analysis (opens in a new tab)

  12. 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. …

    waterloo Repository record for MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbour Search (opens in a new tab)

  13. Deep Hashing for Image Similarity Search

    … 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 nearest neighbor search in this code …

    ucf Repository record for Deep Hashing for Image Similarity Search (opens in a new tab)

  14. Proximity problems for high-dimensional data

    … The core problem, for both data types, is the nearest neighbor searching problem. Given a set of objects P , we aim for a data structure which supports nearest neighbor queries; a new object q arrives and the data structure returns the most similar object in P . When the data complexity is …

    greece Repository record for Proximity problems for high-dimensional data (opens in a new tab)

  15. HNSW grafų algoritmas apytikslio artimiausio kaimyno paieškai /

    … HNSW algorithm and its potential applications in approximate nearest neighbor search tasks.

    vilnius Repository record for HNSW grafų algoritmas apytikslio artimiausio kaimyno paieškai / (opens in a new tab)

  16. 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. …

    missouri Repository record for Identification of spatial patterns in spatially resolved multi-omics (opens in a new tab)

  17. Approximate Range Searching In The Absolute Error Model

    … related problems, including range sketching, approximate nearest neighbor searching, exact idempotent range searching, approximate range searching in the data stream model, and approximate range searching in the relative model.

    maryland Repository record for Approximate Range Searching In The Absolute Error Model (opens in a new tab)

  18. Τεχνικές ομαδοποίησης και κοντινότερου γείτονα για οπτική αναζήτηση εικόνων

    … 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 vector spaces or metric spaces, respectively.We first introduce a clustering method that …

    greece Repository record for Τεχνικές ομαδοποίησης και κοντινότερου γείτονα για οπτική αναζήτηση εικόνων (opens in a new tab)

  19. Salient Index for Similarity Search Over High Dimensional Vectors

    The approximate nearest neighbor(ANN) search over high dimensional data has become an unavoidable service for online applications. Fast and high-quality results of unknown queries are the largest challenge that most algorithms faced with. Locality Sensitive Hashing(LSH) is a well-known ANN search …

    mcmaster Repository record for Salient Index for Similarity Search Over High Dimensional Vectors (opens in a new tab)

Page 1 of 3