Sciweavers

102 search results - page 10 / 21
» Optimal Approximation of Elliptic Problems by Linear and Non...
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
ICML
2004
IEEE
14 years 1 months ago
Learning a kernel matrix for nonlinear dimensionality reduction
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
Kilian Q. Weinberger, Fei Sha, Lawrence K. Saul
SIAMJO
2010
121views more  SIAMJO 2010»
13 years 6 months ago
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
Identifying small groups of lines, whose removal would cause a severe blackout, is critical for the secure operation of the electric power grid. We show how power grid vulnerabilit...
Ali Pinar, Juan Meza, Vaibhav Donde, Bernard C. Le...
IJCNN
2007
IEEE
14 years 2 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
CDC
2009
IEEE
180views Control Systems» more  CDC 2009»
13 years 11 months ago
Robustness analysis for Least Squares kernel based regression: an optimization approach
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
Tillmann Falck, Johan A. K. Suykens, Bart De Moor