5595 search results - page 328 / 1119 » Approximation Algorithms for Clustering Problems |
196
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
162
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
137
click to vote
OPODIS
2004
15 years 8 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
206
click to vote
SOFSEM
2007
Springer
16 years 25 days ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
179
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...