61 search results - page 6 / 13 » Computational Indistinguishability: A Sample Hierarchy |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
SIGGRAPH
2000
ACM
13 years 11 months ago
2000
ACM
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist o...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
Trajectory methods sample the state trajectory of a circuit as it simulates in the time domain, and build macromodels by reducing and interpolating among the linearizations create...
ICCSA
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. This paper presents a new fast and local method of 3D surface reconstruction for scattered data. The algorithm makes use of quasiinterpolants to compute the control point...