2124 search results - page 219 / 425 » Aggregating time partitions |
233
click to vote
EDBT
2011
ACM
14 years 8 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
128
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Coverage and connectivity issues of three-dimensional (3D) networks are addressed in [2], but that work assumes that a node can be placed at any arbitrary location. In this work, ...
155
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
230
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
Previous work on mining transactional database has focused primarily on mining frequent itemsets, association rules, and sequential patterns. However, interesting relationships be...
157
click to vote
EWSN
2004
Springer
16 years 4 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...