We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
In the context of mobile data access, data caching is fundamental for both performance and functionality. For this reason there have been many studies into developing energy-effi...
Ganesh Santhanakrishnan, Ahmed Amer, Panos K. Chry...
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
Bruno Heidelberger, Matthias Teschner, Markus H. G...
Abstract—The peer-to-peer networking concept has revolutionized the cost structure of Internet data dissemination by making large scale content delivery with low server cost feas...
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...