Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract).
Alexandru PopaPrudence W. H. WongFencol C. C. YungPublished in: TAMC (2012)
Keyphrases
- extended abstract
- approximation error
- computational complexity
- approximation algorithms
- objective function
- np complete
- convex functions
- phase transition
- learning theory
- constraint satisfaction problems
- np hard
- multiscale
- information systems
- state machines
- online discussion
- regularization term
- asynchronous cellular automata
- constraint satisfaction
- error bounds
- closed form
- database
- worst case
- probability distribution
- image sequences
- search engine
- learning algorithm