318 search results - page 27 / 64 » Decomposition of Domains |
ICIP
2004
IEEE
15 years 12 months ago
2004
IEEE
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
77
Voted
DATE
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
87
Voted
ICPP
1996
IEEE
15 years 2 months ago
1996
IEEE
: We study the scalability of 2-D discrete wavelet transform algorithms on fine-grained parallel architectures. The principal operation in the 2-D DWT is the filtering operation us...
86
Voted
WCRE
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
91
Voted
ICCAD
2007
IEEE
2007
IEEE
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
15 years 2 months ago
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...