Sciweavers

2957 search results - page 498 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
COMPGEOM
2000
ACM
15 years 10 months ago
Fast computation of generalized Voronoi diagrams using graphics hardware
: 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...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
PODS
2000
ACM
112views Database» more  PODS 2000»
15 years 10 months ago
Auditing Boolean Attributes
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
Jon M. Kleinberg, Christos H. Papadimitriou, Prabh...
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 10 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
SIGGRAPH
2000
ACM
15 years 10 months ago
Environment matting extensions: towards higher accuracy and real-time capture
Environment matting is a generalization of traditional bluescreen matting. By photographing an object in front of a sequence of structured light backdrops, a set of approximate li...
Yung-Yu Chuang, Douglas E. Zongker, Joel Hindorff,...
SMA
1999
ACM
152views Solid Modeling» more  SMA 1999»
15 years 10 months ago
Fast volume-preserving free form deformation using multi-level optimization
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
Gentaro Hirota, Renee Maheshwari, Ming C. Lin