352 search results - page 29 / 71 » A local search approximation algorithm for k-means clusterin... |
97
Voted
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
84
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Image spam is a new obfuscating method which spammers invented to more effectively bypass conventional text based spam filters. In this paper, we extract local invariant features ...
BMCBI
2006
14 years 9 months ago
2006
Background: Non-negative matrix factorisation (NMF), a machine learning algorithm, has been applied to the analysis of microarray data. A key feature of NMF is the ability to iden...
103
click to vote
MFCS
2009
Springer
15 years 2 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...