The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
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...
Theodoros Tzouramanis, Michael Vassilakopoulos, Ya...
Thispaper addresses the problem of estimating, analyzing and tracking objects moving with spatio-temporal rotational motion (i.e. the angular velocity of spinning or orbiting moti...
Jean-Pierre Leduc, Jonathan R. Corbett, M. Victor ...
Spatial, temporal and spatio-temporal aggregates over continuous streams of remotely sensed image data build a fundamental operation in many applications in the environmental scie...