10633 search results - page 1315 / 2127 » Relating Distributed Objects |
195
click to vote
ICML
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
211
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
232
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
180
click to vote
ICDT
2010
ACM
16 years 4 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
189
click to vote
SOSP
2003
ACM
16 years 4 months ago
2003
ACM
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highlyava...