9842 search results - page 358 / 1969 » Problem complexity |
177
Voted
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
158
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
174
Voted
DAGSTUHL
2003
15 years 8 months ago
2003
— The paper focuses on the problem how a community of distributed agents may autonomously invent and coordinate lexicons and grammars. Although our earlier experiments have shown...
165
click to vote
IANDC
1998
15 years 6 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
189
click to vote
IAT
2006
IEEE
16 years 28 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...