17760 search results - page 255 / 3552 » A Generalization of the Massey-Ding Algorithm |
117
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
153
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
140
click to vote
AAAI
2008
15 years 7 months ago
2008
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupt...
178
Voted
MLDM
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
115
click to vote
ACL
2006
15 years 6 months ago
2006
In this paper, we describe a rote extractor that learns patterns for finding semantic relationships in unrestricted text, with new procedures for pattern generalization and scorin...