Sciweavers

214 search results - page 21 / 43
» A Convex Programming Approach to the Trace Quotient Problem
Sort
View
ICML
2009
IEEE
16 years 17 days ago
Learning structural SVMs with latent variables
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
Chun-Nam John Yu, Thorsten Joachims
WCET
2010
14 years 9 months ago
On the Use of Context Information for Precise Measurement-Based Execution Time Estimation
The present paper investigates the influence of the execution history on the precision of measurementbased execution time estimates for embedded software. A new approach to timing...
Stefan Stattelmann, Florian Martin
FGCS
2010
119views more  FGCS 2010»
14 years 10 months ago
Characterizing fault tolerance in genetic programming
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
Daniel Lombraña Gonzalez, Francisco Fern&aa...
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
14 years 12 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
100
Voted
ILP
2007
Springer
15 years 6 months ago
Applying Inductive Logic Programming to Process Mining
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
Evelina Lamma, Paola Mello, Fabrizio Riguzzi, Serg...