Whether you’ve welcomed the rise of the machines with open arms, unplugged the wi-fi and barricaded the door to prevent it from reaching your office, or ...

Abstract: Establishing correspondence between two given geometrical graph structures is an important problem in computer vision and pattern recognition. In this paper, we propose a robust graph ...

Abstract: Lipschitz extensions were proposed as a tool for designing differentially private algorithms for approximating graph statistics. However, efficiently computable Lipschitz extensions were ...

ModelingToolkit.jl is a modeling framework for high-performance symbolic-numeric computation in scientific computing and scientific machine learning. It allows for users to give a high-level ...

Bergm provides a comprehensive framework for Bayesian parameter estimation and model selection for exponential random graph models using advanged computational algorithms. It can also supply graphical ...