Sciweavers

18 search results - page 2 / 4
» Memory efficient skeletonization of utility maps
Sort
View
CODES
2005
IEEE
14 years 17 days ago
Memory access optimizations in instruction-set simulators
Design of programmable processors and embedded applications requires instruction-set simulators for early exploration and validation of candidate architectures. Interpretive simul...
Mehrdad Reshadi, Prabhat Mishra
DSN
2006
IEEE
13 years 10 months ago
Efficiently Detecting All Dangling Pointer Uses in Production Servers
In this paper, we propose a novel technique to detect all dangling pointer uses at run-time that is efficient enough for production use in server codes. One idea (previously used ...
Dinakar Dhurjati, Vikram S. Adve
IPAS
2010
13 years 9 months ago
A memory-efficient and time-consistent filtering of depth map sequences
View plus depth` is a 3D video representation where a single color video channel is augmented with per-pixel depth information in the form of gray-scale video sequence. This repre...
Sergey Smirnov, Atanas P. Gotchev, Karen O. Egiaza...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 6 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
CODES
2008
IEEE
14 years 1 months ago
Don't forget memories: a case study redesigning a pattern counting ASIC circuit for FPGAs
Modern embedded compute platforms increasingly contain both microprocessors and field-programmable gate arrays (FPGAs). The FPGAs may implement accelerators or other circuits to s...
David Sheldon, Frank Vahid