Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
Raymond Phan, Richard Rzeszutek, Dimitrios Androut...
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
When a multitude of RFID tags are in the interrogating field, an anti-collision technology must be used. In literatures, the reading performance was mainly investigated on the er...