7228 search results - page 220 / 1446 » From Algorithmic to Subjective Randomness |
130
click to vote
PODS
2001
ACM
16 years 4 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
133
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
139
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
135
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
248
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...