15485 search results - page 557 / 3097 » Computing Optimal Subsets |
208
click to vote
CVPR
2008
IEEE
15 years 8 months ago
2008
IEEE
A large variety of image features has been invented for detection of objects of a known class. We propose a framework to optimize the discrimination-efficiency tradeoff in integra...
211
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
166
Voted
NA
2008
15 years 7 months ago
2008
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
156
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
245
click to vote
CVPR
2009
IEEE
2009
IEEE
Continuous Ratio Optimization via Convex Relaxation with Applications to Multiview 3D Reconstruction
17 years 2 months ago
We introduce a convex relaxation framework to optimally
minimize continuous surface ratios. The key idea is to minimize
the continuous surface ratio by solving a sequence
of con...