5372 search results - page 140 / 1075 » complexity 2007 |
IGPL
2007
13 years 7 months ago
2007
In this paper, the relationship between the e-value of a complex hypothesis, H, and those of its constituent elementary hypotheses, Hj
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
APAL
2006
13 years 8 months ago
2006
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
APPML
2007
13 years 8 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
ESANN
2006
13 years 9 months ago
2006
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...