160 search results - page 24 / 32 » Sparse decompositions in |
119
click to vote
BMCBI
2010
14 years 5 months ago
2010
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
100
click to vote
SCIA
2009
Springer
15 years 5 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
107
click to vote
FCT
2003
Springer
15 years 3 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
84
Voted
MM
2010
ACM
14 years 10 months ago
2010
ACM
The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incom...
SIAMMAX
2010
14 years 5 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...