791 search results - page 76 / 159 » Approximating the Maximum Sharing Problem |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
ICA
2010
Springer
13 years 8 months ago
2010
Springer
Two-photon calcium imaging is an emerging experimental technique that enables the study of information processing within neural circuits in vivo. While the spatial resolution of th...
IJCAI
1997
13 years 9 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...