Search Results for author: Vitaliy Kurlin

Found 10 papers, 3 papers with code

Accelerating Material Property Prediction using Generically Complete Isometry Invariants

1 code implementation22 Jan 2024 Jonathan Balasingham, Viktor Zamaraev, Vitaliy Kurlin

Material or crystal property prediction using machine learning has grown popular in recent years as it provides a computationally efficient replacement to classical simulation methods.

Property Prediction

Compact Graph Representation of crystal structures using Point-wise Distance Distributions

no code implementations19 Dec 2022 Jonathan Balasingham, Viktor Zamaraev, Vitaliy Kurlin

Use of graphs to represent crystal structures has become popular in recent years as they provide a natural translation from atoms and bonds to nodes and edges.

Property Prediction Translation

Entropic trust region for densest crystallographic symmetry group packings

no code implementations24 Feb 2022 Miloslav Torda, John Y. Goulermas, Roland Púček, Vitaliy Kurlin

Molecular crystal structure prediction (CSP) seeks the most stable periodic structure given the chemical composition of a molecule and pressure-temperature conditions.

Fast predictions of lattice energies by continuous isometry invariants of crystal structures

1 code implementation11 Aug 2021 Jakob Ropers, Marco M Mosca, Olga Anosova, Vitaliy Kurlin, Andrew I Cooper

Crystal Structure Prediction (CSP) aims to discover solid crystalline materials by optimizing periodic arrangements of atoms, ions or molecules.

The asymptotic behaviour and a near linear time algorithm for isometry invariants of periodic sets

1 code implementation5 Sep 2020 Daniel Widdowson, Marco Mosca, Angeles Pulido, Vitaliy Kurlin, Andrew I Cooper

The fundamental model of a periodic structure is a periodic point set up to rigid motion or isometry.

Materials Science 51-08 (Primary) 51K05 14L24, 74E15 (Secondary) G.0; J.2; I.3.5

Resolution-independent meshes of super pixels

no code implementations29 Oct 2019 Vitaliy Kurlin, Philip Smith

Such a mesh of polygons can be rendered at any higher resolution with all edges kept straight.

Clustering Segmentation +1

Book embeddings of Reeb graphs

no code implementations5 Dec 2013 Vitaliy Kurlin

Let the nodes of $Reeb(f, X)$ be all homologically critical points where any homology of the corresponding component of the level set $f^{-1}(t)$ changes.

A fast and robust algorithm to count topologically persistent holes in noisy clouds

no code implementations CVPR 2014 Vitaliy Kurlin

The holes in a given cloud are quantified by the topological persistence of their boundary contours when the cloud is analyzed at all possible scales.

Approximating persistent homology for a cloud of $n$ points in a subquadratic time

no code implementations5 Dec 2013 Vitaliy Kurlin

The Vietoris-Rips filtration for an $n$-point metric space is a sequence of large simplicial complexes adding a topological structure to the otherwise disconnected space.

Topological Data Analysis

Cannot find the paper you are looking for? You can Submit a new open access paper.