Sciweavers

511 search results - page 9 / 103
» Reconstruction Using Witness Complexes
Sort
View
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
TIP
2011
195views more  TIP 2011»
13 years 4 months ago
Accelerating X-Ray Data Collection Using Pyramid Beam Ray Casting Geometries
Abstract—Image reconstruction from its projections is a necessity in many applications such as medical (CT), security, inspection, and others. This paper extends the 2-D Fan-beam...
Amir Averbuch, Guy Lifschitz, Yoel Shkolnisky
APAL
2004
105views more  APAL 2004»
13 years 9 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
ICIP
2006
IEEE
14 years 11 months ago
Low-Rate Reduced Complexity Image Compression using Directionlets
The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth...
Vladan Velisavljevic, Baltasar Beferull-Lozano, Ma...
DGCI
2006
Springer
13 years 11 months ago
Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...
Sara Brunetti, Alain Daurat, Attila Kuba