4075 search results - page 407 / 815 » Modeling Distributed Algorithm Using B |
191
click to vote
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
147
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
181
click to vote
NIPS
2007
15 years 8 months ago
2007
We propose a Gaussian process (GP) framework for robust inference in which a GP prior on the mixing weights of a two-component noise model augments the standard process over laten...
178
click to vote
PODC
2005
ACM
16 years 12 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
174
Voted
SBIA
2004
Springer
16 years 6 days 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...