565 search results - page 49 / 113 » Colorization by Matrix Completion |
134
click to vote
ICFCA
2009
Springer
15 years 9 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
95
Voted
ISPASS
2005
IEEE
15 years 8 months ago
2005
IEEE
SIMD extensions are the most common technique used in current processors for multimedia computing. In order to obtain more performance for emerging applications SIMD extensions ne...
131
click to vote
IMC
2005
ACM
15 years 7 months ago
2005
ACM
In this work we develop an approach for anomaly detection for large scale networks such as that of an enterprize or an ISP. The traffic patterns we focus on for analysis are that...
124
Voted
IJAR
2007
15 years 2 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
138
Voted
JMLR
2010
14 years 9 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...