Sciweavers

1888 search results - page 97 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
16 years 6 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
ISAAC
2005
Springer
90views Algorithms» more  ISAAC 2005»
15 years 12 months ago
Approximate Colored Range Queries
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
Ying Kit Lai, Chung Keung Poon, Benyun Shi
TKDE
1998
122views more  TKDE 1998»
15 years 6 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
WWW
2008
ACM
16 years 7 months ago
Supporting anonymous location queries in mobile environments with privacygrid
This paper presents PrivacyGrid - a framework for supporting anonymous location-based queries in mobile information delivery systems. The PrivacyGrid framework offers three unique...
Bhuvan Bamba, Ling Liu, Péter Pesti, Ting W...
SIGGRAPH
2010
ACM
15 years 10 months ago
Synthesizing structured image hybrids
Example-based texture synthesis algorithms generate novel texture images from example data. A popular hierarchical pixel-based approach uses spatial jitter to introduce diversity,...
Eric Risser, Charles Han, Rozenn Dahyot, Eitan Gri...