—Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. I...
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
We have developed a threaded parallel data streaming approach using Logistical Networking (LN) to transfer multi-terabyte simulation data from computers at NERSC to our local anal...
Viraj Bhat, Scott Klasky, Scott Atchley, Micah Bec...
If the number of users within a workjlow management system (WFMS) increases, a central workflow server (WFserver) and a single local area network (LAN) may become overloaded. The ...
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...