Sciweavers

2257 search results - page 67 / 452
» Secure program partitioning
Sort
View
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 10 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
COMPGEOM
2010
ACM
14 years 1 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
ACSAC
2003
IEEE
14 years 2 months ago
Isolated Program Execution: An Application Transparent Approach for Executing Untrusted Programs
In this paper, we present a new approach for safe execution of untrusted programs by isolating their effects from the rest of the system. Isolation is achieved by intercepting fi...
Zhenkai Liang, V. N. Venkatakrishnan, R. Sekar
EAAI
2006
189views more  EAAI 2006»
13 years 8 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...
EGH
2004
Springer
14 years 2 months ago
Mio: fast multipass partitioning via priority-based instruction scheduling
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
Andrew Riffel, Aaron E. Lefohn, Kiril Vidimce, Mar...