14 search results - page 1 / 3 » Efficient temporal counting with bounded error |
VLDB
2008
ACM
14 years 5 months ago
2008
ACM
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
CCR
2008
13 years 5 months ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
DAWAK
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents an efficient method for approximation of temporal video data using linear Bezier fitting. For a given sequence of frames, the proposed method estimates the int...