733 search results - page 26 / 147 » Recommending random walks |
90
Voted
ECCV
2006
Springer
15 years 11 months 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
15 years 10 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...
118
click to vote
DAGM
2009
Springer
15 years 4 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
15 years 3 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...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...