We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
In this work we consider an inference task that biologists are very good at: deciphering biological processes by bringing together knowledge that has been obtained by experiments u...
Christian Widmer, Jose Leiva, Yasemin Altun, Gunna...