Sciweavers

306 search results - page 16 / 62
» Performance of Data-Parallel Spatial Operations
Sort
View
CIKM
1994
Springer
13 years 11 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
ICDM
2005
IEEE
149views Data Mining» more  ICDM 2005»
14 years 1 months ago
A Join-Less Approach for Co-Location Pattern Mining: A Summary of Results
Spatial co-location patterns represent the subsets of features whose instances are frequently located together in geographic space. Co-location pattern discovery presents challeng...
Jin Soung Yoo, Shashi Shekhar, Mete Celik
GEOINFORMATICA
1998
79views more  GEOINFORMATICA 1998»
13 years 7 months ago
Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...
Yun-Wu Huang, Matthew C. Jones, Elke A. Rundenstei...
VRST
2005
ACM
14 years 1 months ago
Human performance in space telerobotic manipulation
This paper considers the utility of VR in the design of the interface to a space-based telerobotic manipulator. An experiment was conducted to evaluate the potential for improved ...
Philip Lamb, Dean Owen
TKDE
1998
122views more  TKDE 1998»
13 years 7 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