2434 search results - page 31 / 487 » Algorithmic Randomness of Closed Sets |
124
Voted
DC
2000
15 years 3 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
109
Voted
LCN
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
138
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
118
Voted
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
134
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We consider the Bayesian inference of a random Gaussian vector in a linear model with a random Gaussian matrix. We review two approaches to finding the MAP estimator for this m...