Sciweavers

5606 search results - page 265 / 1122
» Randomization Techniques for Graphs.
Sort
View
JGAA
2007
142views more  JGAA 2007»
15 years 6 months ago
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
Kerri Morgan, Graham Farr
EUC
2005
Springer
16 years 23 hour 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...
DIMVA
2006
15 years 8 months ago
Detecting Self-mutating Malware Using Control-Flow Graph Matching
Next generation malware will by be characterized by the intense use of polymorphic and metamorphic techniques aimed at circumventing the current malware detectors, based on pattern...
Danilo Bruschi, Lorenzo Martignoni, Mattia Monga
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
16 years 20 days ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
DATE
2010
IEEE
160views Hardware» more  DATE 2010»
15 years 11 months ago
Soft error-aware design optimization of low power and time-constrained embedded systems
— In this paper, we examine the impact of application task mapping on the reliability of MPSoC in the presence of single-event upsets (SEUs). We propose a novel soft erroraware d...
Rishad A. Shafik, Bashir M. Al-Hashimi, Krishnendu...