5115 search results - page 248 / 1023 » On Randomized Lanczos Algorithms |
186
click to vote
HICSS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
214
Voted
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
200
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
167
click to vote
ISBI
2008
IEEE
16 years 7 months ago
2008
IEEE
This paper describes a general purpose algorithm to segment any kind of lesions in CT images. The algorithm expects a click or a stroke inside the lesion from the user and learns ...
274
Voted
COLOGNETWENTE
2010
15 years 5 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...