TD : Codes-correcteurs Christophe Ritzenthaler Codes non lin´ eaires 1. Calculer la distance de Hamming entreet).

Source URL: perso.univ-rennes1.fr

Hamming Distance Metric Learning Mohammad Norouzi† David J. Fleet† Ruslan Salakhutdinov†,‡ †

Source URL: papers.nips.cc

Accepted Manuscript Lossless filter for multiple repetitions with Hamming distance Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Alair Pereira do Lago, Marie-France Sagot PII:

Source URL: pbil.univ-lyon1.fr

Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance Zhenjie Zhang1 1

Source URL: event.cwi.nl

• Computing
• Formal languages
• Linguistics
• Mathematics
• Pattern matching
• Character encoding
• String
• Comparison of programming languages
• Hamming distance
• Edit distance
• N-gram
• Java Persistence Query Language

On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes Alexander May? and Ilya Ozerov?? Horst G¨ ortz Institute for IT-Security Ruhr-University Bochum, Germany

Source URL: www.cits.rub.de

• Coding theory
• Error detection and correction
• Numerical analysis
• Finite fields
• Search algorithms
• Linear code
• Nearest neighbor search
• Algorithm
• Linear algebra
• Hamming distance
• List decoding
• Decoding methods

ACCELERATING MULTIMODAL SEQUENCE RETRIEVAL WITH CONVOLUTIONAL NETWORKS Laboratory for the Recognition and Organization of Speech and Audio Colin Raffel () and Daniel P. W. Ellis (), L

Source URL: colinraffel.com

• Mathematics
• Geometry
• Search algorithms
• Dynamic programming
• Information science
• Dynamic time warping
• Time series analysis
• Hamming distance
• Sequence
• Hash function
• Pattern recognition

ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE March 15, 2016 Abstract. Let C ⊆ [r]m be a code such that any two words of C have Hamming distance at least

Source URL: homepages.wmich.edu

Problem set First steps in Research - Error correcting codes. 1. A [n, k, d]Σ code is perfect if for every x ∈ Σn there exists a codeword c within Hamming distance d−1 2 . Prove that the [7, 4, 3]2 Hamming code is

Source URL: tq.cs.tau.ac.il

Randomness extraction and asymptotic Hamming distance Cameron E. Freer and Bjørn Kjos-Hanssen∗ Abstract We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-L¨

Source URL: cfreer.org

Fast Search in Hamming Space with Multi-Index Hashing Mohammad Norouzi Ali Punjani David J. Fleet Department of Computer Science University of Toronto

Source URL: www.cs.toronto.edu

• Mathematics
• Hash function
• Locality-sensitive hashing
• Hash table
• Nearest neighbor search
• Hamming weight
• Trie
• K-d tree
• Hamming distance
• Search algorithms
• Information science
• Information retrieval