Sciweavers

17 search results - page 4 / 4
» An exact algorithm for the knapsack sharing problem with com...
Sort
View
TSP
2008
151views more  TSP 2008»
13 years 5 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
KDD
2009
ACM
243views Data Mining» more  KDD 2009»
14 years 6 months ago
Exploiting Wikipedia as external knowledge for document clustering
In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...
Xiaohua Hu, Xiaodan Zhang, Caimei Lu, E. K. Park, ...