236 search results - page 34 / 48 » Learning How to Propagate Using Random Probing |
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
CSCLP
2006
Springer
14 years 20 days ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
JMLR
2011
13 years 3 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
CVPR
2006
IEEE
14 years 11 months ago
2006
IEEE
Recently, many global stereo methods have achieved good results by modeling a disparity surface as a Markov random field (MRF) and by solving an optimization problem with various ...