188 search results - page 8 / 38 » Solving Rational Eigenvalue Problems via Linearization |
ISSAC
2005
Springer
14 years 3 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
SIAMSC
2008
13 years 9 months ago
2008
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...
MANSCI
2008
13 years 9 months ago
2008
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
SIGECOM
2011
ACM
13 years 19 days ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
CVPR
2012
IEEE
12 years 7 days ago
2012
IEEE
This paper presents a general multi-view feature extraction approach that we call Generalized Multiview Analysis or GMA. GMA has all the desirable properties required for cross-vi...