5153 search results - page 99 / 1031 » Introduction to Randomized Algorithms |
137
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
101
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Finding the largest clique in random graphs is a well known hard problem. It is known that a random graph G(n, 1/2) almost surely has a clique of size about 2 log n. A simple greed...
105
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
139
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
101
click to vote
ICML
1998
IEEE
16 years 3 months ago
1998
IEEE
Three factors are related in analyses of performance curves such as learning curves: the amount of training, the learning algorithm, and performance. Often we want to know whether...