Results 261 to 270 of about 18,476 (288)
Some of the next articles are maybe not open access.

A Compressed Index for Hamming Distances

2014
Some instances of multimedia data can be represented as high dimensional binary vectors under the hamming distance. The standard index used to handle queries is Locality Sensitive Hashing (LSH), reducing approximate queries to a set of exact searches.
Francisco Santoyo   +2 more
openaire   +1 more source

Pattern matching in the Hamming distance with thresholds

Information Processing Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mikhail J. Atallah, Timothy W. Duket
openaire   +2 more sources

Hamming Distance based Clustering Algorithm

International Journal of Information Retrieval Research, 2012
Cluster 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

Anonymized Distance Filter in Hamming Space

2016
Search algorithms typically involve intensive distance computations and comparisons. In privacy-aware applications such as biometric identification, exposing the distance information may lead to compromise of sensitive data that have privacy and security implications.
Yi Wang 0017   +3 more
openaire   +1 more source

Algorithms for the Maximum Hamming Distance Problem

2005
We study the problem of finding two solutions to a constraint satisfaction problem which differ on the assignment of as many variables as possible – the Max Hamming Distance problem for CSPs – a problem which can, among other things, be seen as a domain independent way of quantifying “ignorance.” The first algorithm we present is an $\mathcal{O}(1.7338^
Ola Angelsmark, Johan Thapper
openaire   +1 more source

The Use of Hamming Distance in Bioinformatics

2012
Abstract We present the major issues concerning the use of the Hamming distance and its generalizations in bioinformatics. Hamming distance type measures have enjoyed a perennial usage in the fields of biodiversity, genetics, ecology, among many others. Bioinformatics data bring new challenges to statistical procedures.
Aluísio Pinheiro   +2 more
openaire   +1 more source

Evolutive Tandem Repeats Using Hamming Distance

2002
In 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

Approximate Memristive In-Memory Hamming Distance Circuit

ACM Journal on Emerging Technologies in Computing Systems, 2020
Christof Teuscher
exaly  

Similarity-based Android malware detection using Hamming distance of static binary features

Future Generation Computer Systems, 2020
Rahim Taheri   +2 more
exaly  

Two quantum protocols for secure hamming distance computation

Quantum Information Processing, 2018
Run-Hua Shi, Shun Zhang, Shi Run-Hua
exaly  

Home - About - Disclaimer - Privacy