5624 search results - page 440 / 1125 » On Conditional Covering Problem |
178
click to vote
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...
135
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
169
click to vote
ICA
2004
Springer
16 years 9 days ago
2004
Springer
We consider the Blind Source Separation problem of linear mixtures with singular matrices and show that it can be solved if the sources are sufficiently sparse. More generally, we ...
193
click to vote
SCVMA
2004
Springer
16 years 8 days ago
2004
Springer
This paper deals with the motion detection problem. This issue is of key importance in many application fields. To solve this problem, we compute the dominant motion in the sequen...
225
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...