Sciweavers

919 search results - page 11 / 184
» Efficient computation of view subsets
Sort
View
ICDE
2007
IEEE
151views Database» more  ICDE 2007»
14 years 8 months ago
Computing Compressed Multidimensional Skyline Cubes Efficiently
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
CVPR
2008
IEEE
14 years 9 months ago
FuzzyMatte: A computationally efficient scheme for interactive matting
In this paper, we propose an online interactive matting algorithm, which we call FuzzyMatte. Our framework is based on computing the fuzzy connectedness (FC) [20] from each unknow...
Yuanjie Zheng, Chandra Kambhamettu, Jingyi Yu, Tho...
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 8 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 8 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
CVPR
2010
IEEE
14 years 3 months ago
Linear View Synthesis Using a Dimensionality Gap Light Field Prior
Acquiring and representing the 4D space of rays in the world (the light field) is important for many computer vision and graphics applications. Yet, light field acquisition is c...
Anat Levin, Fredo Durand