10608 search results - page 383 / 2122 » Complexity of O'Hara's Algorithm |
117
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
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...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
104
click to vote
TASLP
2010
14 years 7 months ago
2010
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
Most people believe that renaming is easy: simply choose a name at random; if more than one process selects the same name, then try again. We highlight the issues that occur when t...