1161 search results - page 31 / 233 » Approximation schemes for clustering problems |
CORR
2010
Springer
14 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
95
Voted
ISPASS
2003
IEEE
15 years 2 months ago
2003
IEEE
Power-performance optimization is a relatively new problem area particularly in the context of server clusters. Poweraware request distribution is a method of scheduling service r...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Vectors [Extended Abstract] Pekka Orponen and Satu Elisa Schaeffer Laboratory for Theoretical Computer Science, P.O. Box 5400 FI-02015 TKK Helsinki University of Technology, Finlan...
KDD
1997
ACM
15 years 1 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
177
Voted
ICDT
2009
ACM
15 years 10 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...