263 search results - page 13 / 53 » Minimum Entropy Coloring |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, Shannon’s entropy power inequality (EPI) seems...
102
click to vote
DAM
2002
14 years 11 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
154
click to vote
CHES
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper, the evaluation of random bit generators for security applications is discussed and the concept of stateless generator is introduced. It is shown how, for t...
ICIP
2001
IEEE
16 years 1 months ago
2001
IEEE
We describe an algorithm for the analysis of color images of basins which gather dirty water, with the objective of detecting and estimate the presence of exceeding combustible oi...
MICCAI
2001
Springer
15 years 4 months ago
2001
Springer
Assessment of normal and abnormal anatomical variability requires a coordinate system enabling inter-subject comparison. We present a binary minimum entropy criterion to assess afï...