Sciweavers

555 search results - page 97 / 111
» Polar codes are optimal for lossy source coding
Sort
View
ASPLOS
1996
ACM
13 years 11 months ago
A Quantitative Analysis of Loop Nest Locality
This paper analyzes and quantifies the locality characteristics of numerical loop nests in order to suggest future directions for architecture and software cache optimizations. Si...
Kathryn S. McKinley, Olivier Temam
EMSOFT
2009
Springer
13 years 11 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 8 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
APCCAS
2006
IEEE
251views Hardware» more  APCCAS 2006»
14 years 1 months ago
Design of a Dynamic PCM Selector for Non-deterministic Environment
—The quality of transmission is very important in digital communication. However, in non-deterministic environment or different transmission message signal, bit error rate of PCM...
Liang-Bi Chen, Ing-Jer Huang, Yuan-Long Jeang
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
13 years 12 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras