Sciweavers

214 search results - page 15 / 43
» A Convex Programming Approach to the Trace Quotient Problem
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
14 years 6 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
CVPR
2008
IEEE
16 years 1 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
ACML
2009
Springer
15 years 3 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
CDC
2008
IEEE
139views Control Systems» more  CDC 2008»
15 years 6 months ago
Iterative Risk Allocation: A new approach to robust Model Predictive Control with a joint chance constraint
Abstract— This paper proposes a novel two-stage optimization method for robust Model Predictive Control (RMPC) with Gaussian disturbance and state estimation error. Since the dis...
Masahiro Ono, Brian C. Williams
WSC
2008
15 years 2 months ago
Optimizing portfolio tail measures: Asymptotics and efficient simulation optimization
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
Sandeep Juneja