Sciweavers

114 search results - page 15 / 23
» Dynamic Spatial Approximation Trees for Massive Data
Sort
View
CGI
2000
IEEE
14 years 10 days ago
Dynamic 3D Maps and Their Texture-Based Design
Three-dimensional maps are fundamental tools for presenting, exploring, and manipulating geo data. This paper describes multiresolution concepts for 3D maps and their texture-base...
Jürgen Döllner, Klaus Hinrichs
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 8 months ago
Relational data pre-processing techniques for improved securities fraud detection
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
Andrew Fast, Lisa Friedland, Marc Maier, Brian Tay...
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
FUZZIEEE
2007
IEEE
13 years 11 months ago
A System for Querying with Qualitative Distances in Networks
A central role of Geographic Information Systems (GIS) is to allow the identification and visualisation of relevant spatial features from typically large volumes of data. This requ...
Carl P. L. Schultz, Hans W. Guesgen, Robert Amor
SI3D
2005
ACM
14 years 1 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...