Sciweavers

52 search results - page 5 / 11
» Binary codes from the line graph of the n-cube
Sort
View
VIROLOGY
2010
179views more  VIROLOGY 2010»
13 years 4 months ago
Automatic binary deobfuscation
Abstract. This paper gives an overview of our research in the automation of the process of software protection analysis. We will focus more particularly on the problem of obfuscati...
Yoann Guillot, Alexandre Gazet
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 6 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
USS
2004
13 years 7 months ago
Static Disassembly of Obfuscated Binaries
Disassembly is the process of recovering a symbolic representation of a program's machine code instructions from its binary representation. Recently, a number of techniques h...
Christopher Krügel, William K. Robertson, Fre...
CGF
2004
92views more  CGF 2004»
13 years 5 months ago
Para-Graph: Graph-Based Parameterization of Triangle Meshes with Arbitrary Genus
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...
Giuseppe Patanè, Michela Spagnuolo, Bianca ...
TIT
1998
127views more  TIT 1998»
13 years 5 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...