2312 search results - page 62 / 463 » The complexity of estimating min-entropy |
ISMIS
2003
Springer
14 years 3 months ago
2003
Springer
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
AAAI
2007
14 years 8 days ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
ISSRE
2007
IEEE
13 years 11 months ago
2007
IEEE
In any software project, developers need to be aware of existing dependencies and how they affect their system. We investigated the architecture and dependencies of Windows Server...
IPL
2006
13 years 10 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
ICIP
2000
IEEE
14 years 11 months ago
2000
IEEE
This paper deals with techniques to detect abrupt scene transitions when random brightness variations (flicker) are present. This is normally the case when trying to restore or in...