Sciweavers

125 search results - page 11 / 25
» DOT: A Spatial Access Method Using Fractals
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 9 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 10 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss
SIAMNUM
2011
110views more  SIAMNUM 2011»
13 years 2 months ago
A Posteriori Error Control for Discontinuous Galerkin Methods for Parabolic Problems
We derive energy-norm a posteriori error bounds for an Euler timestepping method combined with various spatial discontinuous Galerkin schemes for linear parabolic problems. For acc...
Emmanuil H. Georgoulis, Omar Lakkis, Juha M. Virta...
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
14 years 2 months ago
Discovering Spatial Interaction Patterns
Abstract. Advances in sensing and satellite technologies and the growth of Internet have resulted in the easy accessibility of vast amount of spatial data. Extracting useful knowle...
Chang Sheng, Wynne Hsu, Mong Lee, Anthony K. H. Tu...