Sciweavers

79 search results - page 12 / 16
» Piercing random boxes
Sort
View
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
14 years 1 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
14 years 28 days ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
TOMACS
2011
139views more  TOMACS 2011»
13 years 3 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
CVPR
2009
IEEE
15 years 3 months ago
LidarBoost: Depth Superresolution for ToF 3D Shape Scanning
Depth maps captured with time-of-flight cameras have very low data quality: the image resolution is rather limited and the level of random noise contained in the depth maps is v...
Sebastian Schuon (Stanford University), Christian ...
HPDC
1999
IEEE
14 years 22 days ago
An Evaluation of Linear Models for Host Load Prediction
This paper evaluates linear models for predicting the Digital Unix five-second load average from 1 to 30 seconds into the future. A detailed statistical study of a large number of...
Peter A. Dinda, David R. O'Hallaron