5510 search results - page 416 / 1102 » Mathematics |
159
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
163
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
153
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumpti...
160
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
A fundamental problem in artificial intelligence is that nobody really knows what intelligence is. The problem is especially acute when we need to consider artificial systems whic...
164
click to vote
CRYPTOLOGIA
2006
15 years 7 months ago
2006
For a recent student conference, the authors developed a day-long design problem and competition suitable for engineering, mathematics, and science undergraduates. The competition ...