3244 search results - page 49 / 649 » On convex complexity measures |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
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...
102
click to vote
CIMAGING
2009
15 years 13 days ago
2009
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
IDA
2010
Springer
14 years 9 months ago
2010
Springer
We propose a clustering algorithm that effectively utilizes feature order preferences, which have the form that feature s is more important than feature t. Our clustering formulati...
101
click to vote
DCG
2006
14 years 11 months ago
2006
Abstract. Hyperbolic area is characterized as the unique continuous isometry invariant simple valuation on convex polygons in H2 . We then show that continuous isometry invariant s...