Results 231 to 240 of about 74,857 (256)
Some of the next articles are maybe not open access.
Information Retrieval, 2002
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between objects that, most frequently, are represented as vectors. This paper considers vectors of bits. Such data structures implement entities as diverse as bitmaps that indicate the occurrences of terms and bitstrings indicating the ...
Abraham Bookstein +2 more
openaire +1 more source
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between objects that, most frequently, are represented as vectors. This paper considers vectors of bits. Such data structures implement entities as diverse as bitmaps that indicate the occurrences of terms and bitstrings indicating the ...
Abraham Bookstein +2 more
openaire +1 more source
HAMFAST: Fast Hamming Distance Computation
2009 WRI World Congress on Computer Science and Information Engineering, 2009Similarity is a vague concept which can be treated in a quantitative manner only using appropriate mathematical representation of the objects to compare and a metric on the space representation. In biology the mathematical representation of structure relies on strings taken from an alphabet of m symbols. Very often binary strings, m = 2, are used.
PAPPALARDO, FRANCESCO +4 more
openaire +2 more sources
Genetic code, hamming distance and stochastic matrices
Bulletin of Mathematical Biology, 2004In this paper we use the Gray code representation of the genetic code C=00, U=10, G=11 and A=01 (C pairs with G, A pairs with U) to generate a sequence of genetic code-based matrices. In connection with these code-based matrices, we use the Hamming distance to generate a sequence of numerical matrices.
He, Matthew +2 more
openaire +4 more sources
On private Hamming distance computation
The Journal of Supercomputing, 2013Finding similarities between two datasets is an important task in many research areas, particularly those of data mining, information retrieval, cloud computing, and biometrics. However, maintaining data protection and privacy while enabling similarity measurements has become a priority for data owners in recent years.
Kok-Seng Wong, Myung Ho Kim
openaire +1 more source
On minimal Hamming compatible distances
RAIRO - Theoretical Informatics and Applications, 2014Summary: A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric and show this metric is minimal in the class of all ``well-behaved'' Hamming compatible metrics.
Bakhtary, Parsa, Echi, Othman
openaire +1 more source
Evolutive Tandem Repeats Using Hamming Distance
2002In this paper, we present an algorithm for detecting a "new" type of approximate repeat in texts, named evolutive tandem repeat. An evolutive tandem repeat consists in the concatenation of a series of copies, where every copy might slightly differ from its predecessor.
Groult, Richard +2 more
openaire +2 more sources
Hamming Distance based Clustering Algorithm
International Journal of Information Retrieval Research, 2012Cluster analysis has been extensively used in machine learning and data mining to discover distribution patterns in the data. Clustering algorithms are generally based on a distance metric in order to partition the data into small groups such that data instances in the same group are more similar than the instances belonging to different groups.
Ritu Vijay +2 more
openaire +1 more source
Fat points, partial intersections and Hamming distance
Journal of Algebra and Its Applications, 2019We use two main techniques, namely, residuation and separators of points, to show that the Hilbert function of a certain fat point set supported on a grid complete intersection is the same as the Hilbert function of a reduced set of points called a partial intersection. As an application, we answer a question of Tohǎneanu and Van Tuyl which relates the
Cooper S. M., Guardo E.
openaire +3 more sources
Hamming Distance and Normalization Circuits
2007 International Conference on Communications, Circuits and Systems, 2007The Hamming distance and normalization are important in many digital signal processing algorithms apart from multiply and multiply-accumulate operations. These operations are time consuming unless complex hardware is included, increasing power consumption and latency.
openaire +1 more source