Search Results for author:
Found 3 papers, 3 papers with code
Approximate Network Motif Mining Via Graph Learning
Frequent and structurally related subgraphs, also known as network motifs, are valuable features of many graph datasets.
VeRNAl: Mining RNA Structures for Fuzzy Base Pairing Network Motifs
State of the art methods solve special cases of the motif problem by constraining the structural variability in occurrences of a motif, and narrowing the substructure search space.
Proposal for a fully decentralized blockchain and proof-of-work algorithm for solving NP-complete problems
We propose a proof-of-work algorithm that rewards blockchain miners for using computational resources to solve NP-complete puzzles.
Distributed, Parallel, and Cluster Computing Cryptography and Security
Cannot find the paper you are looking for? You can
Submit a new open access paper.
