3454 search results - page 274 / 691 » Modern computer algebra |
327
click to vote
ASPLOS
2009
ACM
16 years 7 months ago
2009
ACM
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
203
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
201
click to vote
JSC
2006
15 years 6 months ago
2006
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
177
click to vote
SIAMSC
2011
15 years 1 months ago
2011
In order to compute polarization energy of biomolecules, we describe a boundary element approach to solving the linearized Poisson–Boltzmann equation. Our approach combines sever...
147
click to vote
ICIP
1995
IEEE
16 years 8 months ago
1995
IEEE
Modern video applications call for computationally intensive data processing at very high data rate. In order to meet the high-performance/low-cost constraints, the stateof-the-ar...