3894 search results - page 474 / 779 » Approximation Algorithms for Biclustering Problems |
161
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
158
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
158
click to vote
STACS
2001
Springer
15 years 9 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
144
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—Multiple-input and multiple-output (MIMO) technique is considered as one of the most promising emerging wireless technologies that can significantly improve transmissio...
143
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...