8669 search results - page 27 / 1734 » Computing matrix representations |
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
COMPGEOM
1997
ACM
13 years 12 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
SIGMETRICS
2000
ACM
14 years 8 hour ago
2000
ACM
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...