This repository contains programming tasks and solutions from the "Discrete Mathematics" course, with a focus on Graph Theory and Recursive Relations. The primary aim is to solve advanced problems in ...
Recursion is a principle closely related to mathematical induction. In a recursive definition, an object is defined **in terms of itself**. We can recursively define sequences, functions and sets. > ...
ABSTRACT: Almost estimators are designed for the white observation noise. In the estimation problems, rather than the white observation noise, there might be actual cases where the observation noise ...
Topological recursion is a new universal structure, which has been recently applied to different applications like the Kontsevich model and Mirzakhani's recursions codifying intersection numbers and ...
Abstract: In this article, the recursive Bayesian estimation problem is investigated for a class of linear discrete-time systems subject to state-dependent packet dropouts. During the transmission to ...
Abstract: This brief introduces an innovative recursive discrete cosine transform (DCT) algorithm characterized by its exceptional precision and minimal multiplication requirements. Through the ...
ABSTRACT: This paper develops a new method for calculating the system size distribution on two different M/G/1 queueing system under N-policy with general startup/closedown. Firstly, the stochastic ...
Description: The course covers topics in discrete mathematics which are essential to the discipline of computer technology. These include: logic, sequences, mathematical induction, basic set theory, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback