311 search results - page 9 / 63 » Better streaming algorithms for clustering problems |
PPSN
2004
Springer
14 years 1 days ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
IMC
2007
ACM
13 years 8 months ago
2007
ACM
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
CLOUDCOM
2010
Springer
13 years 4 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
CSB
2005
IEEE
14 years 10 days ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
ICML
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...