As mobile devices become location-aware, they offer the promise of powerful new applications. While computers work with physical locations like latitude and longitude, people thin...
Changqing Zhou, Pamela J. Ludford, Dan Frankowski,...
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parall...
Rupak Biswas, Leonid Oliker, Sajal K. Das, Daniel ...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
In this paper, we propose a simple but effective
image prior - dark channel prior to remove haze from a single
input image. The dark channel prior is a kind of statistics
of the...
Kaiming He (The Chinese University of Hong Kong), ...