Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
With the evolution of Graphics Processing Units (GPUs) into powerful and cost-efficient computing architectures, their range of application has expanded tremendously, especially i...
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on conge...
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...