Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and...
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
Abstract. Bounded-exhaustive testing is an automated testing methodology that checks the code under test for all inputs within given bounds: first the user describes a set of test...
Vilas Jagannath, Yun Young Lee, Brett Daniel, Dark...
Low-complexity video encoding has been applicable to several emerging applications. Recently, distributed video coding (DVC) has been proposed to reduce encoding complexity to the...