129 search results - page 2 / 26 » Matrix Decomposition Problem Is Complete for the Average Cas... |
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
In this paper an algorithm based on the ensemble empirical mode decomposition (EEMD) is presented. The key idea on the EEMD relies on averaging the modes obtained by EMD applied t...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...