Journal ArticleDOI
Some approaches to best-match file searching
W. A. Burkhard,Robert M. Keller +1 more
Reads0
Chats0
TLDR
Three file structures are presented together with their corresponding search algorithms, which are intended to reduce the number of comparisons required to achieve the desired result.Abstract:
The problem of searching the set of keys in a file to find a key which is closest to a given query key is discussed. After “closest,” in terms of a metric on the the key space, is suitably defined, three file structures are presented together with their corresponding search algorithms, which are intended to reduce the number of comparisons required to achieve the desired result. These methods are derived using certain inequalities satisfied by metrics and by graph-theoretic concepts. Some empirical results are presented which compare the efficiency of the methods.read more
Citations
More filters
Book ChapterDOI
MeTree: A Metric Spatial Index
TL;DR: In this paper, the MeTree index is proposed to solve metric spatial queries, i.e., looking for objects similar to a given one. But this kind of queries cannot be solved efficiently using spatial o metric indexes separately.
Journal ArticleDOI
Pre-NeRF 360: Enriching Unbounded Appearances for Neural Radiance Fields
TL;DR: In this paper , the authors proposed a new framework to boost the performance of NeRF-based architectures yielding significantly superior outcomes compared to the prior work, including handling multiple video inputs, selecting keyframes, and extracting poses from real-world frames that are ambiguous and symmetrical.
Políticas de selección de pivotes para índices métricos
TL;DR: In this article, a modelo de Espacios Metricos permite formalizar el concept of busqueda por similitud in bases of datos no tradicionales.
Proceedings ArticleDOI
Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata
TL;DR: This article presented a data structure and an algorithm for approximate dictionary searching that rely on ternary search trees and implicit Levenshtein automata and scale well with the sizes of both alphabets and dictionaries.
Book ChapterDOI
A Radial Search Method for Fast Nearest Neighbor Search on Range Images
TL;DR: When tested against open source implementations of state-of-the-art NNS algorithms, radial search obtains better performance than the other algorithms in terms of speedup, while yielding the same level of accuracy.
References
More filters
Book
Perceptrons: An Introduction to Computational Geometry
Marvin Minsky,Seymour A. Papert +1 more
TL;DR: The aim of this book is to seek general results from the close study of abstract version of devices known as perceptrons.
Book
Shift register sequences
TL;DR: The Revised Edition of Shift Register Sequences contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences.
Journal ArticleDOI
An Analysis of Some Graph Theoretical Cluster Techniques
J. Gary Augustson,Jack Minker +1 more
TL;DR: Several graph theoretic cluster techniques aimed at the automatic generation of thesauri for information retrieval systems are explored and two algorithms have been tested that find maximal complete subgraphs.
Journal ArticleDOI
Scatter storage techniques
TL;DR: L'article donne une presentation didactique sur les methodes connues utilisees par ceux qui ecrivent les assembleurs and compilateurs de maniere a reduire les temps de recherche dans les tables de symboles.
Journal ArticleDOI
Corrections to Bierstone's Algorithm for Generating Cliques
TL;DR: The counterexamples to their and the modified version of the Bierstone algorithm for finding the set of cliques of a finite undirected linear graph are presented.