151 search results - page 18 / 31 » Optimal (2, n) visual cryptographic schemes |
58
Voted
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
—State-of-art implementations of pipelined ADCs can only realize a multiplying DAC (MDAC) with (2n –1) levels. However, the number of levels needed to optimize the performance ...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
115
click to vote
PODC
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
TVCG
2008
14 years 9 months ago
2008
Abstract-- This paper introduces orthogonal vector field visualization on 2D manifolds: a representation by lines that are perpendicular to the input vector field. Line patterns ar...
IFIP
2003
Springer
15 years 2 months ago
2003
Springer
Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design ...