Sciweavers

102 search results - page 13 / 21
» Compiler Optimizations to Reduce Security Overhead
Sort
View
IEEEPACT
2002
IEEE
14 years 1 months ago
Increasing and Detecting Memory Address Congruence
A static memory reference exhibits a unique property when its dynamic memory addresses are congruent with respect to some non-trivial modulus. Extraction of this congruence inform...
Samuel Larsen, Emmett Witchel, Saman P. Amarasingh...
PVLDB
2010
117views more  PVLDB 2010»
13 years 7 months ago
Building Disclosure Risk Aware Query Optimizers for Relational Databases
Many DBMS products in the market provide built in encryption support to deal with the security concerns of the organizations. This solution is quite effective in preventing data ...
Mustafa Canim, Murat Kantarcioglu, Bijit Hore, Sha...
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Distributed Storage Codes Meet Multiple-Access Wiretap Channels
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
CGO
2008
IEEE
14 years 3 months ago
Automatic array inlining in java virtual machines
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
Christian Wimmer, Hanspeter Mössenböck
IJCAI
2001
13 years 10 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti