2136 search results - page 130 / 428 » Improving on Expectation Propagation |
155
Voted
JMLR
2010
14 years 7 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
134
click to vote
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
—Epidemics dynamics can describe the dissemination of information in delay tolerant networks, in peer to peer networks and in content delivery networks. The control of such dynam...
134
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
134
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
SIGMETRICS
1999
ACM
15 years 5 months ago
1999
ACM
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...