563 search results - page 16 / 113 » Computing approximate PSD factorizations |
111
Voted
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with nonnegative entries by a produ...
FOCS
1993
IEEE
15 years 5 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
116
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
STOC
2007
ACM
16 years 1 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...