GitHub

Algorithms and Data Structures (for Data Science)

The course introduces basic data structures and algorithmic techniques that allow students to solve computational problems on the most important data types, such as sequences, sets, trees, and graphs.
IEEE

Diophantine Equation and the Euclidean Algorithm: Methods and Philosophy of the Algebraic Approach to Linear Multivariable Control [Lecture Notes]

Abstract: The story behind the Euclidean algorithm and its relationship to the solution of the Diophantine equation is examined in this article. The Euclidean algorithm appears in Proposition 2 in ...
LinkedIn

In the Age of AI and Agentic Systems: Why Data Structures & Algorithms Still Matter

These aren’t solved by GPTs. They're solved by you, equipped with fundamentals like Trees, Graphs, and Hashing.
IEEE

Nonnegative Matrix and Tensor Factorization [Lecture Notes]

Abstract: In these lecture notes, the authors have outlined several approaches to solve a NMF/NTF problem. The following main conclusions can be drawn: 1) Multiplicative algorithms are not necessary ...
The Straits Times

Which type of note-taking is better for learning: Laptop or pen and paper?

Once upon a time, university lectures were accompanied by the sound of pens scribbling on paper. But if you go into a lecture hall today, you will hear students tapping on laptops. Devices are now an ...
LinkedIn

RTL design and verification of a Maze Solver Algorithm using Verilog and cocoTB

There are multiple well-known algorithms to solve a maze such as Depth-First Search (DFS), Breath-FIrst Search (BFS), and Dijkstra. This RTL code has been implemented using DFS which is a graph ...
Nature

Earthquake multi-classification detection based velocity and displacement data filtering using machine learning algorithms

Earthquake is one of the natural disasters that have a big impact on society. Currently, there are many studies on earthquake detection. However, the vibrations that were detected by sensors were not ...
Frontiers

A depth-first search algorithm for oligonucleotide design in gene assembly

When synthesizing a gene with a long DNA sequence, it is usually necessary to divide it into several fragments. Based on these fragments, a set of oligonucleotides for gene assembly is produced. Each ...
Frontiers

Reconstruction of tree branching structures from UAV-LiDAR data

The reconstruction of tree branching structures is a longstanding problem in Computer Graphics which has been studied over several data sources, from photogrammetry point clouds to Terrestrial and ...
Nature

A last-in first-out stack data structure implemented in DNA

DNA is being used to engineer an increasing array of biochemical memory devices, both in vitro and in vivo 1. To date, three broad classes of DNA-based memory platforms can be identified: bit memory, ...
PNAS

The overlap gap property: A topological barrier to optimizing over random structures

The problem of optimizing over random structures emerges in many areas of science and engineering, ranging from statistical physics to machine learning and artificial intelligence. For many such ...