Sciweavers

919 search results - page 7 / 184
» Efficient computation of view subsets
Sort
View
DOLAP
2009
ACM
14 years 2 months ago
View usability and safety for the answering of top-k queries via materialized views
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
Eftychia Baikousi, Panos Vassiliadis
ICCV
2007
IEEE
14 years 9 months ago
Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
Patrick Labatut, Jean-Philippe Pons, Renaud Kerive...
3DPVT
2006
IEEE
147views Visualization» more  3DPVT 2006»
14 years 1 months ago
Efficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning
We recently proposed a new and efficient next-bestview algorithm for 3D reconstruction of indoor scenes using active range sensing. We overcome the computation difficulty of evalu...
Kok-Lim Low, Anselmo Lastra
CVPR
2003
IEEE
14 years 9 months ago
The Viewing Graph
The problem we study is; Given N views and a subset of the ??? ??? interview fundamental matrices, which of the other fundamental matrices can we compute using only the precompute...
Noam Levi, Michael Werman
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 7 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan