860 search results - page 28 / 172 » Biased Random Walks |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
ECCV
2006
Springer
15 years 25 days ago
2006
Springer
Image restoration is a keen problem of low level vision. In this paper, we propose a novel - assumption-free on the noise model - technique based on random walks for image enhancem...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
DAGM
2009
Springer
14 years 5 months ago
2009
Springer
The purpose of image segmentation is to partition the pixel grid of an image into connected components termed segments such that (i) each segment is homogenous and (ii) for any pai...
SAT
2005
Springer
14 years 4 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...