3894 search results - page 599 / 779 » Approximation Algorithms for Biclustering Problems |
134
Voted
JMLR
2010
14 years 10 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
174
Voted
SIAMNUM
2010
14 years 10 months ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
164
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
249
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
149
Voted
CISS
2011
IEEE
14 years 7 months ago
2011
IEEE
—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditio...