We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Video error concealment is a post-processing technique that conceals the errors in a decoded video sequence based on data available only at the decoder. Most of the current techni...
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical diļ¬...
Researchers maintain bibliographies and extensive sets of PDF ļ¬les of scholarly publications on their desktop. The lack of proper metadata of downloaded PDFs makes this task a t...
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...