Sciweavers

707 search results - page 55 / 142
» A Practical Method for Quickly Evaluating Program Optimizati...
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
VEE
2009
ACM
146views Virtualization» more  VEE 2009»
14 years 2 months ago
Demystifying magic: high-level low-level programming
r of high-level languages lies in their abstraction over hardware and software complexity, leading to greater security, better reliability, and lower development costs. However, o...
Daniel Frampton, Stephen M. Blackburn, Perry Cheng...
CDC
2009
IEEE
164views Control Systems» more  CDC 2009»
13 years 5 months ago
Real-time MPC - Stability through robust MPC design
Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-...
Melanie Nicole Zeilinger, Colin Neil Jones, Davide...
ACL
1998
13 years 9 months ago
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email
This paper describes a novel method by which a dialogue agent can learn to choose an optimal dialogue strategy. While it is widely agreed that dialogue strategies should be formul...
Marilyn A. Walker, Jeanne Frommer, Shrikanth Naray...

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount