Search Results for author:
Found 2 papers, 0 papers with code
Deep Squared Euclidean Approximation to the Levenshtein Distance for DNA Storage
The Levenshtein distance is approximated by the squared Euclidean distance between the embedding vectors, which is fast calculated and clustering algorithm friendly.
Improving the Expressive Power of Graph Neural Network with Tinhofer Algorithm
In recent years, Graph Neural Network (GNN) has bloomly progressed for its power in processing graph-based data.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
