1283 search results - page 182 / 257 » Learning Voting Trees |
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
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, ...
IJSI
2008
13 years 9 months ago
2008
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...
ML
1998
ACM
13 years 8 months ago
1998
ACM
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...
SBIA
2004
Springer
14 years 2 months ago
2004
Springer
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...
RECOMB
2010
Springer
13 years 10 months ago
2010
Springer
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...