Sciweavers

433 search results - page 60 / 87
» Modified Line Search Method for Global Optimization
Sort
View
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
14 years 2 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
CVPR
2004
IEEE
14 years 9 months ago
Space-Time Video Completion
We present a method for space-time completion of large space-time "holes" in video sequences of complex dynamic scenes. The missing portions are filled-in by sampling sp...
Yonatan Wexler, Eli Shechtman, Michal Irani
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
ICCV
1999
IEEE
13 years 12 months ago
Camera Calibration and the Search for Infinity
This paper considers the problem of self-calibration of a camera from an image sequence in the case where the camera's internal parameters (most notably focal length) may cha...
Richard I. Hartley, Lourdes de Agapito, Ian D. Rei...
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann