151 search results - page 29 / 31 » Optimal (2, n) visual cryptographic schemes |
VLDB
2004
ACM
14 years 21 days ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
ICC
2000
IEEE
13 years 11 months ago
2000
IEEE
fixed rate coding in terms of SNR and average throughput was obtained. In fact, the concept of variable rate adaptive In this paper, we propose a bandwidth efficient error cor- cod...
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k...