437 search results - page 33 / 88 » Proving Termination by Divergence |
151
click to vote
NIPS
2000
15 years 7 months ago
2000
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed....
140
click to vote
ENTCS
2008
15 years 6 months ago
2008
In [24] the authors studied the expressiveness of persistence in the asynchronous -calculus (A) wrt weak barbed congruence. The study is incomplete because it ignores the issue of...
165
click to vote
TIT
2010
15 years 24 days ago
2010
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
134
click to vote
TACS
1997
Springer
15 years 10 months ago
1997
Springer
We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, i...
153
click to vote
JMLR
2006
15 years 6 months ago
2006
In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of M density estimators for the Kullback-Leibler d...