Sciweavers

919 search results - page 127 / 184
» Efficient computation of view subsets
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
SIGGRAPH
1999
ACM
15 years 8 months ago
Rendering with Concentric Mosaics
This paper presents a novel 3D plenoptic function, which we call concentric mosaics. We constrain camera motion to planar concentric circles, and create concentric mosaics using a...
Heung-Yeung Shum, Li-wei He
135
Voted
BTW
2007
Springer
142views Database» more  BTW 2007»
15 years 10 months ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
PVLDB
2008
116views more  PVLDB 2008»
15 years 3 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
SIGGRAPH
1992
ACM
15 years 8 months ago
An importance-driven radiosity algorithm
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
Brian E. Smits, James Arvo, David Salesin