Sciweavers

1422 search results - page 217 / 285
» Hierarchical Spatial Data Structures
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 8 months ago
Space-efficient approximate Voronoi diagrams
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...
Sunil Arya, Theocharis Malamatos, David M. Mount
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 7 months ago
Dynamic Trees and Dynamic Point Location
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...
Michael T. Goodrich, Roberto Tamassia
CVPR
2000
IEEE
14 years 9 months ago
Representation and Optimal Recognition of Human Activities
Towards the goal of realizing a generic automatichuman activity recognition system, a new formalism is proposed. Activities are described by a chained hierarchical representation ...
François Brémond, Ramakant Nevatia, ...
ICDCS
2007
IEEE
14 years 2 months ago
A Virtual Node-Based Tracking Algorithm for Mobile Networks
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
Tina Nolte, Nancy A. Lynch
HICSS
2003
IEEE
155views Biometrics» more  HICSS 2003»
14 years 1 months ago
Consumers cognition towards communities: Customer-centred community design using the means-end chain perspective
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...
Peter Aschmoneit, Mark Heitmann