7015 search results - page 218 / 1403 » Approximation algorithms for co-clustering |
203
click to vote
UAI
2003
15 years 7 months ago
2003
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
184
click to vote
PAMI
2007
15 years 6 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
171
click to vote
RTAS
2010
IEEE
15 years 4 months ago
2010
IEEE
Recent research in compositional real-time systems has focused on determination of a component’s real-time interface parameters. An important objective in interface-parameter de...
195
click to vote
CLEF
2010
Springer
15 years 1 months ago
2010
Springer
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
178
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...