Abstract. Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we descri...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...
Christopher James Langmead⋆ and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University We present a novel approach for predicting protein folding kinetics us...
Abstract. We develop a segmentation technique for dynamic PET incorporating the physiological parameters for different regions via kinetic modeling. We demonstrate the usefulness o...
Ahmed Saad, Benjamin Smith 0002, Ghassan Hamarneh,...
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...