Search
Search Results
-
On the Number of 0-Tandems in Simple nD Digital 0-Connected Curves
A 0-tandem is a configuration of two voxels (n-cells) sharing exactly one vertex. We propose a formula connecting the number of 0-tandems in a simple...
-
Three-Dimensional Maximal and Boundary Ghosts
In discrete tomography, ghosts represent indeterminate locations of a reconstruction when there is insufficient projection information to admit a...
-
A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity
Partitioning multi-view data is a recent challenge in clustering methods, which traditionally consider single-view data. In clustering techniques,...
-
Bayesian Maximal Information Coefficient (BMIC) to reason novel trends in large datasets
The Bayesian network (BN) is a probability inference model to describe the explicit relationship between cause and effect, which may be examined in...
-
Computing the Connected Components of the Complement to the Amoeba of a Polynomial in Several Complex Variables
AbstractIn this paper, we propose a method for computing and visualizing the amoeba of a Laurent polynomial in several complex variables, which is...
-
-
An Efficient Run-Based Connected Component Labeling Algorithm for Processing Holes
This article introduces a new connected component labeling and analysis algorithm framework that is able to compute in one pass the foreground and...
-
Reconfiguration of Connected Graph Partitions via Recombination
Motivated by applications in gerrymandering detection, we study a reconfiguration problem on connected partitions of a connected graph G. A partition...
-
VPC: Pruning connected components using vector-based path compression for Graph500
Graphs are an effective approach for data representation and organization, and graph analysis is a promising killer application for AI systems....
-
A Maximal Margin Hypersphere SVM
In this work we propose a generalization of the Support Vector Machine (SVM) method in which the separator is a curve, but the concept of margin and...
-
A Tight Upper Bound on the Length of Maximal Bordered Box Repetition-Free Words
A bordered box repetition-free word is a finite word w where any given factor of the form axa, with...
-
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Paths \(P^1,\ldots ,P^k\) in a graph...
-
On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
Given a mixed graph G, we consider the problem of computing the maximal sets of vertices...
-
-
Improved authentication in vanets using a connected dominating set-based privacy preservation protocol
Vehicular ad hoc networks (VANETs) provide real-time communication between vehicle units for comfortable and safe driving. VANETs are driven by the...
-
The Connected Domination Number of Grids
Closed form expressions for the domination number of an \(n \times m\)...
-
-
Solving Maximal Covering Location Problem Using Chemical Reaction Optimization
The Maximal covering location problem (MCLP) works with a given number of nodes in a network, each node has a demand value and is provided with a...
-
Cycle-Connected Mixed Graphs and Related Problems
In this paper, motivated by vertex connectivity of digraphs or graphs, we address the cycle-connected mixed graph (CCMG) problem. Specifically, given...
-
Shortest node-to-node disjoint paths algorithm for symmetric networks
Disjoint paths are defined as paths between the source and destination nodes where the intermediate nodes in any two paths are disjoint. They are...
