725 search results - page 119 / 145 » A General Greedy Approximation Algorithm with Applications |
119
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
127
Voted
APPROX
2011
Springer
14 years 2 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
176
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
157
Voted
IPSN
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
125
Voted
SIGSOFT
2005
ACM
16 years 3 months ago
2005
ACM
Performance profiling consists of monitoring a software system during execution and then analyzing the obtained data. There are two ways to collect profiling data: event tracing t...