7015 search results - page 6 / 1403 » Approximation algorithms for co-clustering |
ICA
2012
Springer
12 years 3 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
QEST
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Approximation techniques for labelled Markov processes on continuous state spaces were developed by Desharnais, Gupta, Jagadeesan and Panangaden. However, it has not be...
SIAMCOMP
1998
13 years 7 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...