Sciweavers

553 search results - page 3 / 111
» Perfect difference sets constructed from Sidon sets
Sort
View
GLOBECOM
2009
IEEE
14 years 3 months ago
Reusable Set Constructions Using Randomized Dissolvent Templates for Biometric Security
—The emerging biometric cryptography has gained significant interests for key management and privacy protection, but the previously proposed schemes using set metrics for finge...
Jinyang Shi, Kwok-Yan Lam, Ming Gu, Husheng Li
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 8 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 2 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
AIRS
2010
Springer
13 years 6 months ago
Advanced Training Set Construction for Retrieval in Historic Documents
Retrieval in historic documents with non-standard spelling requires a mapping from search terms onto the historic terms in the document. For describing this mapping, we have develo...
Andrea Ernst-Gerlach, Norbert Fuhr