1091 search results - page 78 / 219 » Approximation in Databases |
233
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
149
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
220
click to vote
GIS
2006
ACM
16 years 3 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
108
click to vote
EDBT
2006
ACM
16 years 2 months ago
2006
ACM
Abstract. Streaming environments typically dictate incomplete or approximate algorithm execution, in order to cope with sudden surges in the data rate. Such limitations are even mo...
223
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...