231 search results - page 14 / 47 » Sublinear time approximate clustering |
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
DASFAA
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
ICDM
2008
IEEE
14 years 1 months ago
2008
IEEE
Event detection is a critical task in sensor networks, especially for environmental monitoring applications. Traditional solutions to event detection are based on analyzing one-sh...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...