6045 search results - page 311 / 1209 » Computable Linearizations of Well-partial-orderings |
174
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
191
click to vote
CCCG
2008
15 years 8 months ago
2008
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
181
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
200
click to vote
CIARP
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
195
click to vote
ACTA
2006
15 years 7 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...