54 search results - page 2 / 11 » On Approximating the Entropy of Polynomial Mappings |
DCC
2005
IEEE
14 years 5 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
ASPDAC
2007
ACM
13 years 9 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
DSN
2011
IEEE
12 years 5 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
JAT
2010
13 years 3 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
JCB
2007
13 years 5 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...