231 search results - page 4 / 47 » Sublinear time approximate clustering |
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
Information filtering systems constitute a critical component in modern information seeking applications. As the number of users grows and the information available becomes even bi...
DCC
2002
IEEE
14 years 7 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
IJFCS
2006
13 years 7 months ago
2006
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
MST
2011
13 years 2 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...