Storage capacity as an information-theoretic analogue of vertex cover.
Arya MazumdarAndrew McGregorSofya VorotnikovaPublished in: ISIT (2017)
Keyphrases
- information theoretic
- storage capacity
- vertex cover
- log likelihood
- approximation algorithms
- processing power
- mutual information
- information theory
- computing power
- associative memory
- failure rate
- data transfer
- planar graphs
- precedence constraints
- partial order
- limited resources
- feature selection
- special case
- neural network
- scheduling problem
- embedded systems
- data center
- np hard
- branch and bound algorithm
- bayesian networks
- worst case
- optimality criterion
- polynomial time approximation
- image registration