4539 search results - page 794 / 908 » Approaches to Compute Workflow Complexity |
123
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper studies a variational Bayesian unmixing algorithm for hyperspectral images based on the standard linear mixing model. Each pixel of the image is modeled as a linear com...
147
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
— A new decoding algorithm, referred to as Min-Sum with Adaptive Message Control (AMC-MS), is proposed to reduce the decoding complexity of nonbinary LDPC codes. The proposed alg...
159
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider the problem of tracking a maneuvering target in urban terrain with high clutter. Although multipath has been previously exploited to improve target tracking in complex...
138
click to vote
AAAI
2011
14 years 4 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
159
click to vote
CATA
2000
15 years 5 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...