Search
Search Results
-
Estimating the Distribution Parameter of Non-prolonging Random Dead Time Duration in Recurrent Semi-Synchronous Events Flow Through Maximum Likelihood
The paper explores the recurrent semi-synchronous events flow that is a common mathematical model of information flows of messages that operate in...
-
On Heuristic Algorithm with Greedy Strategy for the Correlation Clustering Problem Solution
The Correlation Clustering (CC) problem is traditionally defined as a problem of partitioning a signed graph without specifying the number of...
-
Decoding of Product Codes in Discrete and Semi-continuous Channels with Memory
Product code construction is a powerful error-correcting tool for both channels with and without memory. The common approach to decoding product...
-
-
On the Identification of a Finite Automaton by Its Input and Output Sequences in Case of Distortions
A method is proposed for checking whether a pair of observed distorted sequences can correspond to the true input and output sequences of a reference...
-
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
We investigate the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs). We focus on the class of DAGs...
-
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms
A variation of the vertex cover problem is the eternal vertex cover problem. This is a two-player (attacker and defender) game, where the defender...
-
On Star Partition of Split Graphs
A graph that is isomorphic to \(K_{1,r}\) for...
-
On Total Chromatic Number of Complete Multipartite Graphs
This paper makes progress towards settling the long-standing conjecture that the total chromatic number...
-
Impact of Diameter and Convex Ordering for Hamiltonicity and Domination
A bipartite graph G(X, Y) is called a star convex bipartite graph with convexity on X if there is an associated star T on X such that for each vertex...
-
Total Coloring of Some Graph Operations
The total chromatic number \(\chi _T (G)\) of G...
-
Growth Rate of the Number of Empty Triangles in the Plane
Given a set P of n points in the plane, in general position, denote by...
-
Semi-total Domination in Unit Disk Graphs
Let \(G=(V, E)\) be a simple undirected graph...
-
Fault Attacks Sensitivity of Public Parameters in the Dilithium Verification
This paper presents a comprehensive analysis of the verification algorithm of the CRYSTALS-Dilithium, focusing on a C reference implementation....
-
Blind Side Channel Analysis Against AEAD with a Belief Propagation Approach
This paper present two new attacks on two lightweight authenticated encryption with associated data (AEAD): Sparkle and...
-
Attacking at Non-harmonic Frequencies in Screaming-Channel Attacks
Screaming-channel attacks enable Electromagnetic (EM) Side-Channel Attacks (SCAs) at larger distances due to higher EM leakage energies than...
-
Can We Infer Move Sequences in Go from Stone Arrangements?
Inference commonly happens in our daily lives and is also a hot topic for AI research. In this paper, we infer move sequences in Go, i.e., the order...
-
Understanding Prostate Cancer Care Process Using Process Mining: A Case Study
Prostate cancer is the fourth most common cancer in the EU-27, with around 470,000 new cases yearly, and the most common cancer among males. Patients...
-
An Explainable AI Framework for Treatment Failure Model for Oncology Patients
The black box nature of current AI models has raised serious concerns about accountability, bias and trust in the models that might undermine their...
-
Feature Selection in Bipolar Disorder Episode Classification Using Cost-Constrained Methods
An important step in the classification process of bipolar disorder episodes is feature selection process indicating the most relevant factors in...