IPL
2006
13 years 4 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
COMBINATORICA
2007
13 years 4 months ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
ECIR
2010
Springer
13 years 5 months ago
2010
Springer
A promising way to accelerate similarity search is semantic hashing which designs compact binary codes for a large number of documents so that semantically similar documents are ma...
CASES
2005
ACM
13 years 6 months ago
2005
ACM
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
ICDAR
2003
IEEE
13 years 9 months ago
2003
IEEE
Classifying an unknown input is a fundamental problem in pattern recognition. A common method is to define a distance metric between patterns and find the most similar pattern i...
DATE
2003
IEEE
13 years 9 months ago
2003
IEEE
A hardware method for functional unit assignment is presented, based on the principle that a functional unit’s power consumption is approximated by the switching activity of its...
DNA
2004
Springer
13 years 9 months ago
2004
Springer
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesir...
CASES
2004
ACM
13 years 9 months ago
2004
ACM
This paper presents and reports on a VLIW code compression technique based on vector Hamming distances [19]. It investigates the appropriate selection of dictionary vectors such t...
CPM
2007
Springer
13 years 10 months ago
2007
Springer
We address the problem of sketching the hamming distance of data streams. We present a new notion of sketching technique, Fixable sketches and we show that using such sketch not o...