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
Journal Article
CEA LIST Participation at TAC EDL English Diagnostic Task.
TL;DR: The purpose of this participation was to test the possibility to use the structure of the database and more specifically the relations between the entities, to improve the entity linking, in particular in the case where there is no textual description for the entity in the knowledge base.
Journal ArticleDOI
Efficient Iris Recognition Management in Object-Related Databases
TL;DR: An extension of an Object Relational Database Management System for the integral management of a biometric system based on the human iris was presented, which includes both the extension of the type system and the definition of domain indexes for performance improvement.
Proceedings ArticleDOI
On the asymptotic behavior of nearest neighbor search using pivot-based indexes
Benjamin Bustos,Nelson Morales +1 more
TL;DR: This paper presents an asymptotic analysis for the nearest neighbor search with pivot-based indexes, and introduces a probabilistic analysis and shows the expected search cost for range-optimal algorithms.
DissertationDOI
Indexação e recuperação de informações utilizando redes neurais da família ART
TL;DR: This work proposes a hybrid system that combines an ART family neural network, ART2-A, with a data structure, Slim-Tree, that is a metric access method to perform the clustering process of data in a "intelligent" way in order the data can be recovered from the corresponding Slim- Tree.
Indexing techniques for metric databases with costly searches
TL;DR: Several new indexing techniques to improve the performance of similarity search are proposed and a generalized nearest neighbor framework and several search and optimization algorithms are proposed.
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.