7106 search results - page 39 / 1422 » Restricted Complexity, General Complexity |
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
JC
2008
13 years 7 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
TIT
1998
13 years 7 months ago
1998
— Nonparametric estimation is usually inconsistent without some form of regularization. One way to impose regularity is through a prior measure. Barron and Cover [1], [2] have sh...
FAW
2008
Springer
13 years 9 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
IJCNN
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...