1489 search results - page 80 / 298 » Optimizing Feature Sets for Structured Data |
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. We propose a novel and efficient method for generic arbitraryview object class detection and localization. In contrast to existing singleview and multi-view methods using...
ANOR
2010
14 years 10 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
We present a novel Quadratic Program (QP) formulation for robust multi-model fitting of geometric structures in vision data. Our objective function enforces both the fidelity of...
TVCG
2010
14 years 8 months ago
2010
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...
ML
2010
ACM
14 years 8 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...