3244 search results - page 184 / 649 » On convex complexity measures |
CORR
2011
Springer
14 years 9 months ago
2011
Springer
In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact trad...
121
click to vote
ICASSP
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper we propose an iterative algorithm for solving the problem of extracting a sparse source signal when a reference signal for the desired source signal is available. In...
176
click to vote
JMLR
2012
13 years 4 months ago
2012
This paper presents new and effective algorithms for learning kernels. In particular, as shown by our empirical results, these algorithms consistently outperform the so-called uni...
106
click to vote
FOCM
2008
15 years 2 months ago
2008
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
120
click to vote
ICSE
2008
IEEE-ACM
16 years 2 months ago
2008
IEEE-ACM
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...