Sciweavers

2843 search results - page 51 / 569
» On Efficient Spatial Matching
Sort
View
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 11 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
DBPL
2007
Springer
158views Database» more  DBPL 2007»
14 years 2 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 11 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
ICIP
2006
IEEE
15 years 20 days ago
Fast Video Shot Retrieval with Luminance Field Trace Indexing and Geometry Matching
Efficient indexing is a key in content-based video retrieval solutions. In this paper we represent video sequences as traces in an appropriate low dimensional space via luminance ...
Li Gao, Zhu Li, Aggelos K. Katsaggelos
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
15 years 6 days ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...