Abstract: Traditional shortest-path graph kernels generate for each graph a histogram-like feature map, whose elements represent the number of occurrences of non-isomorphic shortest paths in this ...

Abstract: Graph encryption is a form of searchable encryption that enables a cloud server to handle private queries on graphs. Ghosh, Kamara, and Tamassia (ASIA CCS 2021) proposed the first graph ...

In this project I used Dijkstra’s Algorithm to find the shortest path in a weighted graph. We take an adjacency matrix as input, asks the user for a starting and ending node, and then step by step the ...

The Ant colony Optimization algorithm is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs (source). This implementation of the ACO ...

Deep-learning throughput hinges on how effectively a compiler stack maps tensor programs to GPU execution: thread/block schedules, memory movement, and instruction selection (e.g., Tensor Core MMA ...