415 search results - page 65 / 83 » An efficient approximation for the Generalized Assignment Pr... |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
AI
2002
Springer
13 years 6 months ago
2002
Springer
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
TON
2008
13 years 6 months ago
2008
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...