Max-flow min-cut theorem for Rényi entropy in communication networks.
Maximilien GadouleauSøren RiisPublished in: ISIT (2011)
Keyphrases
- communication networks
- max flow min cut
- shannon entropy
- problems in computer vision
- energy minimization
- information theoretic
- mutual information
- network structure
- distributed databases
- combinatorial optimization
- min cut
- computer networks
- multiscale
- computer vision
- pairwise
- machine learning
- smart card
- genetic algorithm
- markov random field
- data analysis
- object recognition
- optimal solution