Sciweavers

1258 search results - page 5 / 252
» Table design in dynamic programming
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
Predictor virtualization
Many hardware optimizations rely on collecting information about program behavior at runtime. This information is stored in lookup tables. To be accurate and effective, these opti...
Ioana Burcea, Stephen Somogyi, Andreas Moshovos, B...
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
14 years 14 days ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
BIRTHDAY
2012
Springer
12 years 3 months ago
Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
François-Xavier Standaert, Christophe Petit...
TECS
2002
81views more  TECS 2002»
13 years 7 months ago
System-level exploration of association table implementations in telecom network applications
les to further raise the abstraction level of the initial specification, where dynamic data sets can be specified without low-level details. Our method is suited for hardware and s...
Chantal Ykman-Couvreur, J. Lambrecht, A. Van Der T...
CP
2008
Springer
13 years 9 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre