563 search results - page 10 / 113 » Computing approximate PSD factorizations |
AAECC
2007
Springer
15 years 29 days ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
111
click to vote
CORR
2010
Springer
15 years 28 days ago
2010
Springer
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
86
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
113
Voted
UAI
2004
15 years 2 months ago
2004
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
COCO
2009
Springer
15 years 7 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...