2520 search results - page 423 / 504 » The complexity of approximating entropy |
124
Voted
NIPS
1992
15 years 5 months ago
1992
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
141
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
279
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
135
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
144
click to vote
GLVLSI
2010
IEEE
15 years 4 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...