7015 search results - page 442 / 1403 » Approximation algorithms for co-clustering |
172
click to vote
ICML
1996
IEEE
16 years 7 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
173
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
187
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
193
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
183
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...