We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
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...
—In this paper, we consider joint optimization of end-to-end data transmission and resource allocation for Wireless-Infrastructured Distributed Cellular Networks (WIDCNs), where ...
Lei You, Ping Wu, Mei Song, Junde Song, Yong Zhang
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
Shubao Liu, Kongbin Kang, Jean-Philippe Tarel and ...
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
Edward Curley, Binoy Ravindran, Jonathan Stephen A...