<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Topological graph theory / Discrete mathematics / Planar graphs / Artificial neural network / Deep learning / Graph embedding / Graph / Neural architecture search
Date: 2017-12-30 21:51:59
Graph theory
Mathematics
Topological graph theory
Discrete mathematics
Planar graphs
Artificial neural network
Deep learning
Graph embedding
Graph
Neural architecture search

Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection

Add to Reading List

Source URL: acmccs.github.io

Download Document from Source Website

File Size: 2,51 MB

Share Document on Facebook

Similar Documents

Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1  Institute of Discrete Mathematics and Geometry, Vienna University of Technology

Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology

DocID: 1xTCQ - View Document

Using Alloy in a Language Lab Approach to Introductory Discrete Mathematics Charles Wallace Michigan Technological University In collaboration with Laura Brown, Adam Feltz

Using Alloy in a Language Lab Approach to Introductory Discrete Mathematics Charles Wallace Michigan Technological University In collaboration with Laura Brown, Adam Feltz

DocID: 1xTvc - View Document

Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math), 322–337. doi:AADM100425018H

Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.bg.ac.yu Appl. Anal. Discrete Math), 322–337. doi:AADM100425018H

DocID: 1vmuF - View Document

Discrete Mathematics and Theoretical Computer Science  DMTCS vol. (subm.), by the authors, 1–1 A lower bound for approximating the grundy number

Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1–1 A lower bound for approximating the grundy number

DocID: 1vkug - View Document

Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is

Hausdorff Center for Mathematics, Summer School (May 9–13, 2016) Problems for “Discrete Convex Analysis” (by Kazuo Murota) Problem 1. Prove that a function f : Z2 → R defined by f (x1 , x2 ) = φ(x1 − x2 ) is

DocID: 1vjVY - View Document