2740 search results - page 398 / 548 » Approximating Component Selection |
NIPS
2008
15 years 2 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
110
Voted
NIPS
2007
15 years 2 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
119
Voted
NIPS
2007
15 years 2 months ago
2007
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
71
Voted
AAAI
2004
15 years 2 months ago
2004
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
102
Voted
NAACL
2004
15 years 2 months ago
2004
Previous work demonstrated that web counts can be used to approximate bigram frequencies, and thus should be useful for a wide variety of NLP tasks. So far, only two generation ta...