25 search results - page 2 / 5 » Hashing by Proximity to Process Duplicates in Spatial Databa... |
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
GIS
2009
ACM
13 years 11 months ago
2009
ACM
Volunteered geographic information such as that available in blogs, wikis, social networking sites, and community contributed photo collections is enabling new applications. This ...
ICDAR
2011
IEEE
12 years 4 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
DEXA
2004
Springer
13 years 10 months ago
2004
Springer
Efficient storage and retrieval of trajectory indexes has become an essential requirement for moving objects databases. The existing 3DR-tree is known to be an effective trajectory...