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
Patent
Methods for using extracted features and annotations associated with an electronic media work to perform an action
TL;DR: In this article, a method including the steps of: receiving, by a computer system including at least one computer, a first electronic media work uploaded from a first e cient device, extracting one or more features from the first E cient document, linking the first electronic document with a reference electronic media document, storing the correlation information, correlating the query with action information related to an action to be performed, and generating machine-readable instructions based upon the action information.
Posted Content
Chemical Names Standardization using Neural Sequence to Sequence Model.
Junlang Zhan,Hai Zhao +1 more
TL;DR: This paper proposes a framework to do the auto standardization from the non-systematic names to the corresponding systematic names by using the spelling error correction, byte pair encoding tokenization and neural sequence to sequence model.
Patent
Method for using extracted features from an electronic work
TL;DR: In this article, a computer-implemented method including the steps of maintaining, by a computer system including at least one computer, a database in which is stored first data related to identification of one or more works and second data corresponding to information corresponding to each of the works as identified by the first data.
Consultas métrico espaciales
TL;DR: MeTree as discussed by the authors is a combinación of FQT with R-Tree that permite consultas combinando ambos aspectos, i.e., índices espaciales and métricos.
Learning from time series in the presence of noise: unsupervised and semi-supervised approaches
Eamonn Keogh,Dragomir Yankov +1 more
TL;DR: An effective and highly efficient discord detection algorithm, which used in a parallel fashion can handle hundreds of millions of examples in only a few hours, and an extension of the Isomap algorithm is derived, that remedies the effect of noise and learns more accurately the data embedding subspaces.
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.