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
Application of approximate graph matching techniques for searching databases of two-dimensional chemical structures
TL;DR: A comparison of graph matching techniques for searching for two-dimensional structures of two-DIMENSIONAL CHEMICAL STRUCTures shows good agreement between the types of structures investigated.
Journal ArticleDOI
A Two-Layer Dictionary Organization for Quickly Retrieval
Jau-Ji Shen,Chun-Ta Li +1 more
Dissertation
A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing
TL;DR: This paper aims to provide a chronology of the events leading up to and including the publication of this book and some of the key events that led to its publication.
Patent
System for using extracted features from an electronic work
TL;DR: In this article, a computer system comprising one or more communications devices, one or multiple processors operatively connected to the communication devices, and one or many computer readable media operatively attached to the processors and having stored thereon computer instructions for carrying out the steps of (a) maintaining, by the computer system, a database comprising (1) first data related to identification of one or several works; and (2) second data corresponding to information corresponding to each of the works as identified by the first data; (b) extracting features of a work to be identified; (c
Searching algorithms and data structures for combinatorial, temporal and probabilistic databases
TL;DR: In this paper, the authors propose a solution to solve the problem of the problem: this paper ] of "uniformity" and "uncertainty" of the solution.
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.