5595 search results - page 105 / 1119 » Approximation Algorithms for Clustering Problems |
134
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
173
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
157
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
141
click to vote
ESANN
2004
15 years 7 months ago
2004
Abstract. In many situations, high dimensional data can be considered as sampled functions. We show in this paper how to implement a Self-Organizing Map (SOM) on such data by appro...
168
click to vote
IJKESDP
2010
15 years 4 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...