Sciweavers

360 search results - page 6 / 72
» On Protection by Layout Randomization
Sort
View
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
15 years 9 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
14 years 9 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 2 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
EUC
2005
Springer
15 years 2 months ago
Program Obfuscation Scheme Using Random Numbers to Complicate Control Flow
Abstract. For the security technology that has been achieved with software in the computer system and the protection of the intellectual property right of software, software protec...
Tatsuya Toyofuku, Toshihiro Tabata, Kouichi Sakura...
ICCAD
2009
IEEE
136views Hardware» more  ICCAD 2009»
14 years 7 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...