We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
This paper describes the ongoing implementation of the SimX system for multi-experiment computational studies within the SCIRun problem solving environment. The modular, component...
In this paper we propose an efficient real-time communication mechanism for distributed vision processing. One of the biggest problems of distributed vision processing, as is the ...
We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions do...
Lexing Ying, George Biros, Denis Zorin, Harper Lan...
In this paper, a two-dimensional airfoil shape optimisation problem is investigated using CFD within a grid computing environment (GCE) implemented in Matlab. The feature-based par...
Wenbin Song, Andy J. Keane, M. Hakki Eres, Graeme ...