15073 search results - page 2793 / 3015 » Probabilistic algorithms for computing resultants |
103
Voted
JVCIR
2010
15 years 2 months ago
2010
Efficient representation of images usually leads to improvements in storage efficiency, computational complexity and performance of image processing algorithms. Efficient represe...
128
Voted
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
153
Voted
MICCAI
2010
Springer
15 years 1 months 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...
144
click to vote
PE
2010
Springer
15 years 1 months 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...
135
Voted
SPIRE
2010
Springer
15 years 1 months 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...