Abstract. As low-level architectural support for context-aware computing matures, we are ready to explore more general and powerful means of accessing context data. Information req...
Jeffrey Heer, Alan Newberger, Chris Beckmann, Jaso...
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
This report addresses the issues involved in developing a robust segmentation technique capable of finding the location and orientation of the cervical vertebrae in x-ray images. ...
Abraham Tezmol, Hamed Sari-Sarraf, Sunanda Mitra, ...
Localizing BitTorrent traffic within an ISP in order to avoid excessive and often times unnecessary transit costs has recently received a lot of attention. In this work we attempt...
Commonly used scheduling algorithms in high-level synthesis only accept one process at a time and are not capable of sharing resources across process boundaries. This results in t...