Sciweavers

20 search results - page 3 / 4
» Continuous reformulations of discrete-continuous optimizatio...
Sort
View
CPAIOR
2005
Springer
13 years 11 months ago
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
Jeremy Frank, Elif Kürklü
3DPVT
2004
IEEE
151views Visualization» more  3DPVT 2004»
13 years 10 months ago
Spacetime-Coherent Geometry Reconstruction from Multiple Video Streams
By reconstructing time-varying geometry one frame at a time, one ignores the continuity of natural motion, wasting useful information about the underlying video-image formation pr...
Marcus A. Magnor, Bastian Goldlücke
ML
2007
ACM
13 years 5 months ago
Feature space perspectives for learning the kernel
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
Charles A. Micchelli, Massimiliano Pontil
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
13 years 11 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
SDM
2010
SIAM
168views Data Mining» more  SDM 2010»
13 years 4 months ago
Convex Principal Feature Selection
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
Mahdokht Masaeli, Yan Yan, Ying Cui, Glenn Fung, J...