Sciweavers

5153 search results - page 256 / 1031
» Introduction to Randomized Algorithms
Sort
View
150
Voted
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 4 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
STACS
2007
Springer
15 years 9 months ago
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
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...
Robert Elsässer, Thomas Sauerwald
121
Voted
ISBI
2008
IEEE
16 years 4 months ago
3D general lesion segmentation in CT
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 ...
Marie-Pierre Jolly, Leo Grady
185
Voted
COLOGNETWENTE
2010
15 years 2 months ago
Bisimplicial Edges in Bipartite Graphs
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...
Matthijs Bomhoff, Bodo Manthey
143
Voted
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 10 months ago
Detection of objects in noisy images and site percolation on square lattices
Abstract: We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algori...
Mikhail A. Langovoy, Olaf Wittich