Sciweavers

387 search results - page 35 / 78
» Towards in-place geometric algorithms and data structures
Sort
View
96
Voted
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 4 months ago
K-D Trees Are Better when Cut on the Longest Side
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....
MOBIDE
2005
ACM
15 years 6 months ago
Towards universal mobile caching
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...
116
Voted
VMV
2003
163views Visualization» more  VMV 2003»
15 years 1 months ago
Real-Time Volumetric Intersections of Deforming Objects
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...
PDP
2011
IEEE
14 years 4 months ago
Transport Optimization in Peer-to-Peer Networks
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...
Konstantin Miller, Adam Wolisz
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 5 months ago
Towards proximity pattern mining in large graphs
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...
Arijit Khan, Xifeng Yan, Kun-Lung Wu