IACR
2011
12 years 10 months ago
2011
The Keccak hash function is one of the five finalists in NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: Afte...
ECBS
2011
IEEE
12 years 10 months ago
2011
IEEE
Abstract—Software systems are typically large and exhaustive testing of all possible input parameters is usually not feasible. Testers select tests that they anticipate may catch...
CIKM
2011
Springer
12 years 10 months ago
2011
Springer
This paper offers a novel look at using a dimensionalityreduction technique called simhash [8] to detect similar document pairs in large-scale collections. We show that this algo...
TSMC
2010
13 years 5 months ago
2010
In recent years the protection of biometric data has gained increased interest from the scientific community. Methods such as the fuzzy commitment scheme, helper data system, fuzzy...
ISAAC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. In this paper, we consider the problem of predicate encryption and focus on the predicate for testing whether the hamming distance between the attribute X of a data item ...
OL
2010
13 years 9 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
IPL
2002
13 years 10 months ago
2002
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
CORR
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
TOC
2008
13 years 10 months ago
2008
Abstract: Consider the following version of the Hamming distance problem for
TIT
2008
13 years 10 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...