3894 search results - page 352 / 779 » Approximation Algorithms for Biclustering Problems |
150
click to vote
FSTTCS
2009
Springer
16 years 21 days ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
213
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
206
click to vote
INFOCOM
2008
IEEE
16 years 16 days ago
2008
IEEE
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...
146
Voted
ICPR
2008
IEEE
16 years 17 days ago
2008
IEEE
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...
169
click to vote
UAI
2001
15 years 7 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...