The efforts of an expert to parallelize and optimize a dense linear algebra algorithm for distributed-memory targets are largely mechanical and repetitive. We demonstrate that the...
Bryan Marker, Andy Terrel, Jack Poulson, Don S. Ba...
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
We propose a new circularity measure inspired from Arkin [1], Latecki [9] tools of shape matching that is constructed in a tangent space. We then introduce a linear algorithm that...
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...