2498 search results - page 162 / 500 » Data Structures with Unpredictable Timing |
ADBIS
2000
Springer
15 years 1 months ago
2000
Springer
Research in spatio-temporal databases has largely focused on extensions of access methods for the proper handling of time changing spatial information. In this paper, we present th...
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
— Preserving cultural heritage and historic sites is an important problem. These sites are subject to erosion, vandalism, and as long-lived artifacts, they have gone through many...
SAC
2002
ACM
14 years 9 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...