1541 search results - page 30 / 309 » Analysis of Random Noise and Random Walk Algorithms |
WSC
2001
13 years 10 months ago
2001
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
TSP
2010
13 years 3 months ago
2010
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
LCN
2007
IEEE
14 years 3 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...
ICDAR
2009
IEEE
13 years 7 months ago
2009
IEEE
This paper presents a new approach for the binarization of seriously degraded manuscript. We introduce a new technique based on a Markov Random Field (MRF) model of the document. ...