Sciweavers

736 search results - page 9 / 148
» A dynamic data structure for approximate range searching
Sort
View
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
13 years 10 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
AAMAS
2010
Springer
13 years 9 months ago
Multi-goal economic search using dynamic search structures
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
David Sarne, Efrat Manisterski, Sarit Kraus
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
14 years 1 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
MICS
2010
137views more  MICS 2010»
13 years 7 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun