112 search results - page 8 / 23 » Quasi-interpretation Synthesis by Decomposition |
TSD
2004
Springer
14 years 26 days ago
2004
Springer
This paper presents a new unit selection process for Very Low Bit Rate speech encoding around 500 bits/sec. The encoding is based on speech recognition and speech synthesis technol...
CCGRID
2007
IEEE
14 years 1 months ago
2007
IEEE
Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids. In this paper, a signal decomposition methodology called matching pursuit is appl...
TOG
2012
11 years 10 months ago
2012
We introduce tensor displays: a family of compressive light field displays comprising all architectures employing a stack of timemultiplexed, light-attenuating layers illuminated...
VLSID
2002
IEEE
14 years 13 days ago
2002
IEEE
A new approach to synthesizing totally symmetric Boolean functions is presented. First, a novel cellular array is introduced for synthesizing unate symmetric functions. Using this...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...