Sciweavers

7129 search results - page 926 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CVPR
2012
IEEE
13 years 7 months ago
Multi-class cosegmentation
Bottom-up, fully unsupervised segmentation remains a daunting challenge for computer vision. In the cosegmentation context, on the other hand, the availability of multiple images ...
Armand Joulin, Francis Bach, Jean Ponce
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 7 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
CVPR
2007
IEEE
16 years 6 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
ECCV
2006
Springer
16 years 6 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
128
Voted
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 5 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...