129 search results - page 20 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
AI
2007
Springer
13 years 8 months ago
2007
Springer
In many decision making problems, a number of independent attributes or criteria are often used to individually rate an alternative from an agent’s local perspective and then th...
JMLR
2010
13 years 3 months ago
2010
Methods based on 1-relaxation, such as basis pursuit and the Lasso, are very popular for sparse regression in high dimensions. The conditions for success of these methods are now ...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...