Sciweavers

237 search results - page 38 / 48
» Methods for Achieving Fast Query Times in Point Location Dat...
Sort
View
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
14 years 2 months ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
GIS
2006
ACM
14 years 10 months ago
Object localization based on directional information case of 2D vector data
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
Stelian Coros, JingBo Ni, Pascal Matsakis
ECCV
2002
Springer
14 years 11 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
EDBT
2006
ACM
191views Database» more  EDBT 2006»
14 years 9 months ago
Distributed Spatial Clustering in Sensor Networks
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
Anand Meka, Ambuj K. Singh
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
14 years 1 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein