1220 search results - page 34 / 244 » Restricting grammatical complexity |
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...
JAIR
2008
13 years 7 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
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...
FAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...