Sciweavers

7 search results - page 1 / 2
» Deriving Numerical Abstract Domains via Principal Component ...
Sort
View
SAS
2010
Springer
172views Formal Methods» more  SAS 2010»
13 years 3 months ago
Deriving Numerical Abstract Domains via Principal Component Analysis
Numerical Abstract Domains via Principal Component Analysis Gianluca Amato, Maurizio Parton, and Francesca Scozzari Universit`a di Chieti-Pescara – Dipartimento di Scienze We pro...
Gianluca Amato, Maurizio Parton, Francesca Scozzar...
COMPLIFE
2006
Springer
13 years 8 months ago
Set-Oriented Dimension Reduction: Localizing Principal Component Analysis Via Hidden Markov Models
We present a method for simultaneous dimension reduction and metastability analysis of high dimensional time series. The approach is based on the combination of hidden Markov model...
Illia Horenko, Johannes Schmidt-Ehrenberg, Christo...
ORL
2011
12 years 11 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
SAFECOMP
2010
Springer
13 years 3 months ago
Deriving Safety Cases for Hierarchical Structure in Model-Based Development
Abstract. Model-based development and automated code generation are increasingly used for actual production code, in particular in mathematical and engineering domains. However, si...
Nurlida Basir, Ewen Denney, Bernd Fischer 0002
CEC
2005
IEEE
13 years 10 months ago
Multiobjective clustering around medoids
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
Julia Handl, Joshua D. Knowles