360 search results - page 14 / 72 » On Protection by Layout Randomization |
KDD
2004
ACM
15 years 2 months ago
2004
ACM
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
HOST
2008
IEEE
15 years 3 months ago
2008
IEEE
—A number of applications depend on the protection of security-sensitive hardware, preventing unauthorized users from gaining access to the functionality of the integrated circui...
IV
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
FAW
2009
Springer
15 years 4 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...