5595 search results - page 113 / 1119 » Approximation Algorithms for Clustering Problems |
185
click to vote
DATAMINE
1999
15 years 4 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
171
click to vote
CLOUDCOM
2010
Springer
15 years 2 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...
151
click to vote
JAL
2006
15 years 4 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
159
click to vote
ICIP
2000
IEEE
16 years 6 months ago
2000
IEEE
In this paper, we presentan approach to clustering images for efficient retrieval using relative entropy. We start with the assumption that visual features are represented by prob...
141
click to vote
AAIM
2008
Springer
15 years 11 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...