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
This paper documents a first attempt at "designing for the self", an approach to designing products intended to help people move closer to their idealized sense of self a...
Kursat Kursat Ozenc, James P. Brommer, Bong-keum J...
Optimized opportunistic multicast scheduling (OMS) has been studied previously by the authors for homogeneous cellular networks, where the problem of efficiently transmitting a co...
Tze-Ping Low, Man-On Pun, Yao-Win Peter Hong, C.-C...
We study the times to grow structures within the tile self-assembly model proposed by Winfree, and the possible shapes that can be achieved. Our earlier work was confined to the g...
Yuliy M. Baryshnikov, Edward G. Coffman Jr., Boons...
The possibility of pre-compensating images in a computer display according to the visual aberrations previously assessed in an optical system (e.g., the computer user’s eye) has...
Miguel Alonso Jr., Armando Barreto, Julie A. Jacko...