563 search results - page 14 / 113 » Computing approximate PSD factorizations |
100
click to vote
NIPS
2001
15 years 2 months ago
2001
We describe the g-factor which relates probability distributions on image features to distributions on the images themselves. The g-factor depends only on our choice of features a...
108
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
111
click to vote
ICDT
2005
ACM
15 years 6 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
123
click to vote
IDA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a Bayesian treatment of non-negative matrix factorization (NMF), based on a normal likelihood and exponential priors, and derive an efficient Gibbs sampler to ...
CCCG
2006
15 years 2 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...