736 search results - page 47 / 148 » A dynamic data structure for approximate range searching |
LCN
2008
IEEE
14 years 3 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
SSD
2007
Springer
14 years 2 months ago
2007
Springer
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Information sharing can be effective with structured data. The Semantic Web is mainly aimed at structuring information by creating widely accepted ontologies. However, users have ...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
COMPGEOM
2007
ACM
14 years 23 days ago
2007
ACM
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 ...