Searching for applications that are highly relevant to development tasks is challenging because the high-level intent reflected in the descriptions of these tasks doesn’t usual...
Mark Grechanik, Chen Fu, Qing Xie, Collin McMillan...
In this paper, we present fast algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Nobel Successive Elimination Algorithms fo...
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Disparity estimation can be used to eliminate redundancy among different views in multi-view video compression to obtain high compression efficiency. However, the problem of high c...
Gangyi Jiang, Mei Yu, Feng Shao, You Yang, Haitao ...
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...