Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Towards the goal of realizing a generic automatichuman activity recognition system, a new formalism is proposed. Activities are described by a chained hierarchical representation ...
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
This paper presents research on the application of the means-end chain (MEC) framework for investigating customers cognitive structure regarding community applications. It is argu...