1541 search results - page 112 / 309 » Analysis of Random Noise and Random Walk Algorithms |
162
click to vote
NIPS
2007
15 years 6 months ago
2007
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...
146
click to vote
JCST
2010
14 years 11 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
145
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
136
click to vote
NIPS
2003
15 years 6 months ago
2003
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
134
click to vote
JSAT
2008
15 years 4 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...