dajes
AI is my passion and I am certain that it will change the world. I hope I can increase the probability of good outcomes of this technology.
Kyiv, Ukraine
Pinned Repositories
AnimateDiff
implementation of AnimateDiff.
asl-signs
DensePose-TorchScript
The project is focused on creating simple and TorchScript compilable inference interface for the original pretrained models to free them from the heavy dependency on the detectron2 framework
Divide-in-two-heaps
Divide array in two heaps which are of silimar mass
frame-interpolation-pytorch
PyTorch implementation of FILM: Frame Interpolation for Large Motion, In ECCV 2022.
labelfficient
labelfficient is a simple yet customizable and efficient tool for creating object detection labels
Levenshtein
Finding Levenshtein distance
Max-Subarea
Project with visualization about finding the biggest rectangle avoiding obstacles on a given matrix
Max-subsequence-of-reminderless
Find max subsequence of divisible numbers
Minimize-traversal-cost
Given a matrix A(n, m), each pass through (i, j) grid cell costs A(i, j). The task is to minimise a cost while traversing through the matrix
dajes's Repositories
dajes/frame-interpolation-pytorch
PyTorch implementation of FILM: Frame Interpolation for Large Motion, In ECCV 2022.
dajes/AnimateDiff
implementation of AnimateDiff.
dajes/DensePose-TorchScript
The project is focused on creating simple and TorchScript compilable inference interface for the original pretrained models to free them from the heavy dependency on the detectron2 framework
dajes/labelfficient
labelfficient is a simple yet customizable and efficient tool for creating object detection labels
dajes/asl-signs
dajes/Divide-in-two-heaps
Divide array in two heaps which are of silimar mass
dajes/Levenshtein
Finding Levenshtein distance
dajes/Max-Subarea
Project with visualization about finding the biggest rectangle avoiding obstacles on a given matrix
dajes/Max-subsequence-of-reminderless
Find max subsequence of divisible numbers
dajes/Minimize-traversal-cost
Given a matrix A(n, m), each pass through (i, j) grid cell costs A(i, j). The task is to minimise a cost while traversing through the matrix
dajes/Morph-Strings
Check if string X can be morphed into Y by given rules
dajes/Similar-tables
Compare variety of two tables