5153 search results - page 919 / 1031 » Introduction to Randomized Algorithms |
147
Voted
MICCAI
2010
Springer
15 years 29 days ago
2010
Springer
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
129
click to vote
PE
2010
Springer
15 years 29 days ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
126
click to vote
PKDD
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
124
click to vote
SPIRE
2010
Springer
15 years 28 days ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
104
Voted
TAP
2010
Springer
15 years 28 days ago
2010
Springer
raction, simplification, segmentation, illumination, rendering, and illustration. Even though this technique is inspired by models of low-level human vision, it has not yet been v...