327 search results - page 1 / 66 » Some Elimination Problems for Matrices |
CASC
2007
Springer
13 years 11 months ago
2007
Springer
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
An interesting problem in Nonnegative Matrix Factorization (NMF) is to factorize the matrix X which is of some specific class, for example, binary matrix. In this paper, we exten...