Sciweavers

2188 search results - page 41 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 9 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
CAD
2006
Springer
13 years 8 months ago
Geometric constraints within feature hierarchies
We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the featu...
Meera Sitharam, Jianjun Oung, Yong Zhou, Adam Arbr...
ICCV
2005
IEEE
14 years 10 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
IS
2007
13 years 8 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
MVA
2000
127views Computer Vision» more  MVA 2000»
13 years 8 months ago
Geometric fusion for a hand-held 3D sensor
This article presents a geometric fusion algorithm developed for the reconstruction of 3D surface models from hand-held sensor data. Hand-held systems allow full 3D movement of th...
Adrian Hilton, John Illingworth