Sciweavers

188 search results - page 26 / 38
» Relational Formalism for the Management of Spatial Data
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 12 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
GEOS
2005
Springer
14 years 1 months ago
Processes and Events in Dynamic Geo-Networks
Traditional spatial information systems hold only a single state of the ‘real world’. However, geographic phenomena have not only static but dynamic characteristics. The work d...
Antony Galton, Michael F. Worboys
CVPR
2006
IEEE
14 years 9 months ago
Dynamics Based Robust Motion Segmentation
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
Roberto Lublinerman, Mario Sznaier, Octavia I. Cam...
WWW
2008
ACM
13 years 7 months ago
Discovering co-located queries in geographic search logs
A geographic search request contains a query consisting of one or more keywords, and a search-location that the user searches for. In this paper, we study the problem of discoveri...
Xiangye Xiao, Longhao Wang, Xing Xie, Qiong Luo
GIS
2005
ACM
14 years 8 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang