2124 search results - page 47 / 425 » Aggregating time partitions |
DAC
2000
ACM
14 years 10 months ago
2000
ACM
In this paper we describe a new hardware/software partitioning approach for embedded reconfigurable architectures consisting of a general-purpose processor (CPU), a dynamically re...
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
This article introduces new similarity measures between trajectories, in order to detect uncommon behaviors. These measures are used to find the most common trajectories in a seq...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...