101 search results - page 17 / 21 » The Intractability of Computing the Hamming Distance |
RFIDSEC
2010
13 years 6 months ago
2010
In September 2009, David and Prasad proposed at MobiSec’09 an interesting new ultralightweight mutual authentication protocol for low-cost RFID tags. In this paper, we present a ...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
JMLR
2012
11 years 10 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...