793 search results - page 20 / 159 » Efficient computation of the characteristic polynomial |
SIAMCOMP
2010
13 years 2 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
VMV
2000
13 years 9 months ago
2000
Essentially all Computer Vision strategies require initial computation of orientation structure or motion estimation. Although much work has been invested in this subfield, method...
ICIP
1995
IEEE
14 years 9 months ago
1995
IEEE
Receiver operating characteristics (ROC) curves have the property that they start at (0,l) and end at (1,O) and are monotonically decreasing. Furthermore, a parametric representat...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...