Sciweavers

492 search results - page 65 / 99
» Fast data stream algorithms using associative memories
Sort
View
CASES
2006
ACM
14 years 1 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
ISMVL
2000
IEEE
120views Hardware» more  ISMVL 2000»
14 years 1 days ago
Mod-p Decision Diagrams: A Data Structure for Multiple-Valued Functions
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than t...
Harald Sack, Elena Dubrova, Christoph Meinel
GRID
2006
Springer
13 years 7 months ago
Resource Allocation in Streaming Environments
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
Lu Tian, K. Mani Chandy
MICRO
2009
IEEE
148views Hardware» more  MICRO 2009»
14 years 2 months ago
Flip-N-Write: a simple deterministic technique to improve PRAM write performance, energy and endurance
The phase-change random access memory (PRAM) technology is fast maturing to production levels. Main advantages of PRAM are non-volatility, byte addressability, in-place programmab...
Sangyeun Cho, Hyunjin Lee
ICIP
2002
IEEE
14 years 18 days ago
An iterative algorithm for context selection in adaptive entropy coders
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
Tong Jin, Jacques Vaisey