Sciweavers

135 search results - page 20 / 27
» Properties of tree convex constraints
Sort
View
SIAMIS
2011
13 years 3 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 8 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....
COMPGEOM
2008
ACM
13 years 10 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 5 months ago
Optimal measures and transition kernels
Abstract. We study positive measures that are solutions to an abstract optimisation problem, which is a generalisation of a classical variational problem with a constraint on infor...
Roman V. Belavkin