7015 search results - page 7 / 1403 » Approximation algorithms for co-clustering |
DC
2011
12 years 7 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
EOR
2006
13 years 7 months ago
2006
JACM
2007
13 years 7 months ago
2007
IJCAI
2001
13 years 9 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...