Sciweavers

4084 search results - page 147 / 817
» Constraints in spatial structures
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 7 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
16 years 7 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
LREC
2010
145views Education» more  LREC 2010»
15 years 7 months ago
Inter-Annotator Agreement on a Linguistic Ontology for Spatial Language - A Case Study for GUM-Space
In this paper, we present a case study for measuring inter-annotator agreement on a linguistic ontology for spatial language, namely the spatial extension of the Generalized Upper...
Joana Hois
SIGMOD
2003
ACM
190views Database» more  SIGMOD 2003»
16 years 6 months ago
Hardware Acceleration for Spatial Selections and Joins
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
Chengyu Sun, Divyakant Agrawal, Amr El Abbadi
CSE
2009
IEEE
16 years 28 days ago
Private Buddy Search: Enabling Private Spatial Queries in Social Networks
—With the abundance of location-aware portable devices such as cellphones and PDAs, a new emerging application is to use this pervasive computing platform to learn about the wher...
Ali Khoshgozaran, Cyrus Shahabi