Sciweavers

66 search results - page 4 / 14
» Efficient Matrix Chain Ordering in Polylog Time
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 6 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
ISCAS
2007
IEEE
95views Hardware» more  ISCAS 2007»
14 years 1 months ago
A Universal Approach to Developing Fast Algorithm for Simplified Order-16 ICT
—Simplified order-16 Integer Cosine Transform (ICT) has been proved to be an efficient coding tool especially for High-Definition (HD) video coding and is much simpler than ICT a...
Jie Dong, King Ngi Ngan, Chi-Keung Fong, Wai-kuen ...
ISCAS
2005
IEEE
126views Hardware» more  ISCAS 2005»
14 years 8 days ago
Scheduling algorithm for partially parallel architecture of LDPC decoder by matrix permutation
— The fully parallel LDPC decoding architecture can achieve high decoding throughput, but it suffers from large hardware complexity caused by a large set of processing units and ...
In-Cheol Park, Se-Hyeon Kang
TWC
2010
13 years 1 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos
TIP
2010
137views more  TIP 2010»
13 years 1 months ago
Adaptive Langevin Sampler for Separation of t-Distribution Modelled Astrophysical Maps
We propose to model the image differentials of astrophysical source maps by Student's t-distribution and to use them in the Bayesian source separation method as priors. We int...
Koray Kayabol, Ercan E. Kuruoglu, José Luis...