5115 search results - page 92 / 1023 » On Randomized Lanczos Algorithms |
117
click to vote
IJAC
2008
15 years 2 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
122
Voted
ICDCS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
140
Voted
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...
104
Voted
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...
112
Voted
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...