Sciweavers

151 search results - page 7 / 31
» Optimal (2, n) visual cryptographic schemes
Sort
View
ICISC
2004
96views Cryptology» more  ICISC 2004»
13 years 11 months ago
Efficient Broadcast Encryption Using Multiple Interpolation Methods
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
Eun Sun Yoo, Nam-Su Jho, Jung Hee Cheon, Myung-Hwa...
3DPVT
2002
IEEE
219views Visualization» more  3DPVT 2002»
14 years 2 months ago
A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration
The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N2 ) with the shape...
Timothée Jost, Heinz Hügli
ICITS
2009
13 years 7 months ago
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
Oriol Farràs, Ignacio Gracia, Sebasti&agrav...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 6 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
CP
2005
Springer
14 years 3 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell