Network administrators are faced with the increasingly challenging task of monitoring their network’s health in real time, drawing upon diverse and voluminous measurement data fe...
Lukasz Golab, Theodore Johnson, Subhabrata Sen, Je...
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Most human activities occur around where the user is physically located. Knowing the geographical serving area of web resources, therefore, is very important for many web applicat...
Qi Zhang, Xing Xie, Lee Wang, Lihua Yue, Wei-Ying ...
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann