1403 search results - page 143 / 281 » Set cover algorithms for very large datasets |
192
click to vote
NIPS
2004
15 years 7 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
189
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
171
click to vote
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
142
click to vote
PAM
2010
Springer
16 years 27 days ago
2010
Springer
Active and passive measurements for topology discovery have known an impressive growth during the last decade. If a lot of work has been done regarding inter-domain topology discov...
181
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...