Sciweavers

841 search results - page 151 / 169
» Approximability of Minimum AND-Circuits
Sort
View
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
15 years 10 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
CVPR
2007
IEEE
16 years 8 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
CVPR
2008
IEEE
16 years 8 months ago
Sequential sparsification for change detection
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
Necmiye Ozay, Mario Sznaier, Octavia I. Camps
ICCV
2007
IEEE
16 years 7 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...
ICCV
2005
IEEE
16 years 7 months ago
Quasiconvex Optimization for Robust Geometric Reconstruction
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
Qifa Ke, Takeo Kanade