Sciweavers

2520 search results - page 410 / 504
» The complexity of approximating entropy
Sort
View
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 8 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 8 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 8 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
ICCV
1999
IEEE
15 years 8 months ago
Illumination Distribution from Brightness in Shadows: Adaptive Estimation of Illumination Distribution with Unknown Reflectance
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...
Imari Sato, Yoichi Sato, Katsushi Ikeuchi
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 8 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail