Sciweavers

151 search results - page 23 / 31
» Optimal (2, n) visual cryptographic schemes
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Dimension Reduction and Expansion: Distributed Source Coding in a Noisy Environment
We studied the problem of distributed coding and transmission of intercorrelated sources with memory. Different from the conventional distributed source coding structure which rel...
Anna N. Kim, Fredrik Hekland
TSMC
2010
13 years 2 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...
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
CVPR
2005
IEEE
14 years 9 months ago
Tracking Non-Stationary Appearances and Dynamic Feature Selection
Since the appearance changes of the target jeopardize visual measurements and often lead to tracking failure in practice, trackers need to be adaptive to non-stationary appearance...
Ming Yang, Ying Wu
INFOCOM
2006
IEEE
14 years 1 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz