Sciweavers

1243 search results - page 137 / 249
» Complexity reduction of C-Algorithm
Sort
View
ACIVS
2006
Springer
15 years 7 months ago
Scalable and Channel-Adaptive Unequal Error Protection of Images with LDPC Codes
This paper considers the design of an optimal joint source-channel coding system employing scalable wavelet-based source coders and unequal error protection for error-resilient tra...
Adrian Munteanu, Maryse R. Stoufs, Jan Cornelis, P...
ADC
2006
Springer
169views Database» more  ADC 2006»
15 years 7 months ago
A further study in the data partitioning approach for frequent itemsets mining
Frequent itemsets mining is well explored for various data types, and its computational complexity is well understood. Based on our previous work by Nguyen and Orlowska (2005), th...
Son N. Nguyen, Maria E. Orlowska
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
15 years 7 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ARITH
2005
IEEE
15 years 7 months ago
High-Radix Implementation of IEEE Floating-Point Addition
We are proposing a micro-architecture for highperformance IEEE floating-point addition that is based on a (non-redundant)high-radix representation of the floatingpoint operands....
Peter-Michael Seidel
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
15 years 7 months ago
Energy- and Performance-Driven NoC Communication Architecture Synthesis Using a Decomposition Approach
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
Ümit Y. Ogras, Radu Marculescu