Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IACR
2011
177views more  IACR 2011»
10 years 1 months ago
New attacks on Keccak-224 and Keccak-256
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...
Itai Dinur, Orr Dunkelman, Adi Shamir
ECBS
2011
IEEE
197views Hardware» more  ECBS 2011»
10 years 1 months ago
Finding Interaction Faults Adaptively Using Distance-Based Strategies
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...
Renée C. Bryce, Charles J. Colbourn, D. Ric...
CIKM
2011
Springer
10 years 1 months ago
Probabilistic near-duplicate detection using simhash
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...
Sadhan Sood, Dmitri Loguinov
TSMC
2010
10 years 8 months ago
Binary Biometrics: An Analytic Framework to Estimate the Performance Curves Under Gaussian Assumption
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...
Emile J. C. Kelkboom, Gary Garcia Molina, Jeroen B...
ISAAC
2010
Springer
276views Algorithms» more  ISAAC 2010»
10 years 11 months ago
Anonymous Fuzzy Identity-Based Encryption for Similarity Search
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 ...
David W. Cheung, Nikos Mamoulis, W. K. Wong, Siu-M...
OL
2010
185views more  OL 2010»
10 years 12 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
IPL
2002
110views more  IPL 2002»
11 years 1 months ago
New bounds on a hypercube coloring problem
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...
Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
CORR
2000
Springer
149views Education» more  CORR 2000»
11 years 1 months ago
On The Closest String and Substring Problems
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...
Ming Li, Bin Ma, Lusheng Wang
TOC
2008
71views more  TOC 2008»
11 years 1 months ago
The One-Way Communication Complexity of Hamming Distance
Abstract: Consider the following version of the Hamming distance problem for
T. S. Jayram, Ravi Kumar, D. Sivakumar
TIT
2008
107views more  TIT 2008»
11 years 1 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
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 ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
books