Sciweavers

12052 search results - page 460 / 2411
» computing 2010
Sort
View
JSC
2010
82views more  JSC 2010»
15 years 1 months ago
Linear complete differential resultants and the implicitization of linear DPPEs
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
Sonia L. Rueda, J. Rafael Sendra
SIAMMAX
2010
98views more  SIAMMAX 2010»
15 years 1 months ago
Improved Balanced Incomplete Factorization
In this paper we improve the BIF algorithm which computes simultaneously the LU factors (direct factors) of a given matrix, and their inverses (inverse factors). This algorithm was...
Rafael Bru, José Marín, José ...
SIAMNUM
2010
113views more  SIAMNUM 2010»
15 years 1 months ago
Compactness Properties of the DG and CG Time Stepping Schemes for Parabolic Equations
Abstract. It is shown that for a broad class of equations that numerical solutions computed using the discontinuous Galerkin or the continuous Galerkin time stepping schemes of arb...
Noel Walkington

Source Code
617views
16 years 1 months ago
Affine Registration of Planar Shapes
This is the sample implementation and benchmark dataset of the binary image registration algorithm described in the following paper: Csaba Domokos and Zoltan Kato. Parametric E...
Zsolt Katona, Csaba Domokos, Zoltan Kato
FOCS
2010
IEEE
15 years 4 months ago
The Complexity of Distributions
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
Emanuele Viola