Results 261 to 270 of about 182,933 (316)
Preventive Support Strategies for the Second Victim Phenomenon in Nurses: A Mixed-Method Study. [PDF]
Int Nurs RevLee H, Lee NJ.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
International Journal of Computer Mathematics, 2004
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are discussed. Although the problem of existence of the optimal synchronous codes has not yet resolved, we show that any synchronous code can be considered as an optimal synchronous code for some information source alphabet.
Dongyang Long +2 more
openaire +1 more source
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are discussed. Although the problem of existence of the optimal synchronous codes has not yet resolved, we show that any synchronous code can be considered as an optimal synchronous code for some information source alphabet.
Dongyang Long +2 more
openaire +1 more source
Communications of the ACM, 1969
Methods of analyzing the control flow and data flow of programs during compilation are applied to transforming the program to improve object time efficiency. Dominance relationships, indicating which statements are necessarily executed before others, are used to do global common expression elimination and loop identification.
Edward S. Lowry, C. W. Medlock
openaire +1 more source
Methods of analyzing the control flow and data flow of programs during compilation are applied to transforming the program to improve object time efficiency. Dominance relationships, indicating which statements are necessarily executed before others, are used to do global common expression elimination and loop identification.
Edward S. Lowry, C. W. Medlock
openaire +1 more source
IEEE Transactions on Information Theory, 2001
Summary: Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design.
Vivek K. Goyal +2 more
openaire +1 more source
Summary: Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropy-constrained scalar quantizer (ECSQ) design.
Vivek K. Goyal +2 more
openaire +1 more source
Proceedings DCC 2001. Data Compression Conference, 2002
We propose a new transform coding algorithm that integrates all optimization steps into a coherent and consistent framework. Each iteration of the algorithm is designed to minimize coding distortion as a function of both the transform and quantizer designs.
Cynthia Archer, Todd K. Leen
openaire +1 more source
We propose a new transform coding algorithm that integrates all optimization steps into a coherent and consistent framework. Each iteration of the algorithm is designed to minimize coding distortion as a function of both the transform and quantizer designs.
Cynthia Archer, Todd K. Leen
openaire +1 more source