178 search results - page 22 / 36 » Computing Longest Previous Factor in linear time and applica... |
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Determining the correspondence of image patches is one of the most important problems in Computer Vision. When the intensity space is variant due to several factors such as the ca...
CVPR
2001
IEEE
14 years 10 months ago
2001
IEEE
Outdoor scene classification is challenging due to irregular geometry, uncontrolled illumination, and noisy reflectance distributions. This paper discusses a Bayesian approach to ...
IWPEC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...
MP
2008
13 years 8 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...