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
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
We propose the role-and-relation-based access control (R2 BAC) model for workflow systems. In R2 BAC, in addition to a user's role memberships, the user's relationships w...
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Abstract. This paper describes a multi-disciplinary initiative to promote collaborative research in enactive artificial cognitive systems by developing the iCub : a open-systems 53...