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 98 for “"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 …
-
Scalable Nearest Neighbor Search with Compact Codes
… primitive for analyzing large datasets is the Nearest Neighbor Search problem in which the goal is to preprocess a set of objects, so that later, given a query object, one can find the data object closest to the query. In most situations involving high-dimensional objects, the exhaustive search …
-
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 …
-
Content-based Information Retrieval via Nearest Neighbor Search
… interest in the past few years. When given a search query, the search engine will compare the query with all the stored information in the database through nearest neighbor search. Finally, the system will return the most similar items. We contribute to the CBIR research the following: …
-
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, …
-
Exact L∞-Nearest-Neighbor Search in High Dimensions
In this thesis we consider the nearest-neighbor problem, which is defined as follows: given a fixed set P of n data points in some metric space X, build a data structure such that for each given query point q a data point from P closest to q can be found efficiently. The underlying metric space is …
-
Nearest neighbor search for cyro-electron microscopy images
… microscopy (EM) technology enables researchers to determine the structure of a molecule at a much higher resolution than ever before. The single particle reconstruction (SPR) is one of the most widespread techniques used to reconstruct the 3D model of a molecule from its large set of …
-
Efficient random projection trees for nearest neighbor search and related problems
Nearest neighbor search (NNS) is one of the most well-known problems in the field of computer science. It has been widely used in many different areas such as recommender systems, classification, clustering etc. Given a database S of n objects, a query q, and a measure of similarity, the naive way …
-
Multi-type nearest and reverse nearest neighbor search : concepts and algorithms.
… that expand the scope of traditional database search methods for answering location-based queries in today's computing environment. Traditionally, location-based services and other applications have relied heavily on two concepts: the nearest neighbor search (known also as the proximity, …
-
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 …
-
On the Neutralome of Great Apes and Nearest Neighbor Search in Metric Spaces
… problems to address issues in genomics research. In this dissertation I develop more efficient metric search algorithms. I also show that vast majority of the genomes of great apes are impacted by the forces of natural selection. Finally, I introduce a heuristic to identify …
-
Dynamic Kernel Density Estimation using Approximate Nearest Neighbor Search - A Dynamic Extension of the DEANN Algorithm
… 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) maintains a …
-
A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing
This thesis proposes a k-nearest-neighbor search method inspired by the grid space partitioning and the compact trie tree structure. A detailed implementation based on the Best-First-Nearest-Neighbor-Search scheme is presented and illustrated with sample data. Then k-nearest-neighbor search …
-
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) …
-
Efficient Location Aware Spatial Query
… query has many different types such as k nearest neighbors(kNN), reverse nearest neighbor (RNN), top-k preference query, and skyline set. The spatial database can usually be categorized as certain data and uncertain data. There is a special spatial database, termed spatial database …
-
PARALLELIZATION OF IMAGE PROCESSING AND COMPUTER VISION RELATED ALGORITHMS USING COMMODITY NVIDIA GPGPU
… algorithms we worked on include denoising, nearest neighbor search, contrast enhancement and image segmentation. Performance gain of 18x and 10x was achieved for denoising and nearest neighbor search respectively, which is up to our expectation. However only 3x speedup was achieved for …
Page 1 of 5