6045 search results - page 38 / 1209 » Computable Linearizations of Well-partial-orderings |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
ACMSE
2005
ACM
14 years 1 months ago
2005
ACM
an extended abstract for a poster that presents a new approach that employs metaprogramming to generate optimized code for algorithms in Linear Algebra. Categories and Subject Des...
ADBIS
2009
Springer
14 years 2 months ago
2009
Springer
We propose linear systems of hedge language equations (LSH) as a formalism to represent regular hedge languages. These linear systems are suitable for several computations in the a...
DIS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
LSSC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present an extension of an update technique for preconditioners for sequences of non-symmetric linear systems that was proposed in [5]. In addition, we describe an ide...