Sciweavers

37 search results - page 2 / 8
» Approximate Spatial Query Processing using Raster Signatures
Sort
View
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 4 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
ICIP
2003
IEEE
14 years 6 months ago
Object localization using texture motifs and Markov random fields
This work presents a novel approach to object localization in complex imagery. In particular, the spatial extents of objects characterized by distinct spatial signatures at multip...
Shawn Newsam, Sitaram Bhagavathy, B. S. Manjunath
TKDE
2010
195views more  TKDE 2010»
13 years 3 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 5 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 6 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei