5595 search results - page 65 / 1119 » Approximation Algorithms for Clustering Problems |
119
Voted
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
111
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
167
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
123
Voted
PODS
2006
ACM
16 years 4 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
139
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...