Sciweavers

2996 search results - page 250 / 600
» Numberings and Randomness
Sort
View
RSA
2011
106views more  RSA 2011»
14 years 9 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 2 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
IJCV
2012
13 years 9 months ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
14 years 2 months ago
On the Instantiability of Hash-and-Sign RSA Signatures
The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the o...
Yevgeniy Dodis, Iftach Haitner, Aris Tentes