7106 search results - page 12 / 1422 » Restricted Complexity, General Complexity |
113
click to vote
ML
1998
ACM
15 years 2 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
221
click to vote
CP
2009
Springer
16 years 3 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
137
click to vote
WG
2001
Springer
15 years 7 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
130
click to vote
IR
2007
15 years 3 months ago
2007
Word form normalization through lemmatization or stemming is a standard procedure in information retrieval because morphological variation needs to be accounted for and several la...
145
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...