GitHub

Construct the Lexicographically Largest Valid Sequence

The integer 1 occurs once in the sequence. Each integer between 2 and n occurs twice in the sequence. For every integer i between 2 and n, the distance between the two occurrences of i is exactly i.
IEEE

An Automatic Layer Extraction Algorithm for Ice Sounding Radar Data Based on Curvelet Transform (CT) and Minimum Spanning Tree (MST)

Abstract: Accurate and continuous extraction of ice layer structures from airborne ice sounding radar data is critical for analyzing subglacial hydrothermal environments to support key applications ...
GitHub

07.Sudoku solver.cpp

Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules: - Each of the digits 1-9 must occur exactly once in each row. - Each of ...
IEEE

Iterative Space-Cutting Fast Marching Tree Algorithm for Obstacle-Aware Path Planning in Focused Ultrasound Robotic Systems

Abstract: Magnetic Resonance Imaging-guided High Intensity Focused Ultrasound (MRI-HIFU) requires precise acoustic path planning to ensure safety. This study proposes an Iterative Space ...