7006 search results - page 917 / 1402 » Approximation Algorithms |
227
click to vote
COMPGEOM
2000
ACM
15 years 12 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
205
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
We present an algorithm for real-time level of detail reduction and display of high-complexity polygonal surface data. The algorithm uses a compact and efficient regular grid repr...
201
click to vote
SIAMCOMP
2010
15 years 6 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
210
click to vote
STOC
2007
ACM
16 years 8 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
228
click to vote
CGF
2008
15 years 7 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...