3894 search results - page 75 / 779 » Approximation Algorithms for Biclustering Problems |
172
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
190
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
189
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
166
click to vote
JC
2006
15 years 6 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
155
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...