437 search results - page 33 / 88 » Proving Termination by Divergence |
NIPS
2000
13 years 9 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....
ENTCS
2008
13 years 8 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...
TIT
2010
13 years 2 months 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...
TACS
1997
Springer
14 years 2 days 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...
JMLR
2006
13 years 7 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...