ﻻ يوجد ملخص باللغة العربية
With the development of connected filters for the last decade, many algorithms have been proposed to compute the max-tree. Max-tree allows to compute the most advanced connected operators in a simple way. However, no fair comparison of algorithms has been proposed yet and the choice of an algorithm over an other depends on many parameters. Since the need of fast algorithms is obvious for production code, we present an in depth comparison of five algorithms and some variations of them in a unique framework. Finally, a decision tree will be proposed to help user in choosing the right algorithm with respect to their data.
This is a revised version of our paper published in Journal of Convergence Information Technology(JCIT): Comparison of Feature Point Extraction Algorithms for Vision Based Autonomous Aerial Refueling. We corrected some errors including measurement un
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three known class
For fixed positive integers $r, k$ and $ell$ with $1 leq ell < r$ and an $r$-uniform hypergraph $H$, let $kappa (H, k,ell)$ denote the number of $k$-colorings of the set of hyperedges of $H$ for which any two hyperedges in the same color class inters
The restricted max-min fair allocation problem seeks an allocation of resources to players that maximizes the minimum total value obtained by any player. It is NP-hard to approximate the problem to a ratio less than 2. Comparing the current best algo
The tree-level two-point amplitudes for the transitions $jf to j^{, prime} f^{, prime}$, where $f$ is a fermion and $j$ is a generalized current, in a constant uniform magnetic field of an arbitrary strength and in charged fermion plasma, for the $jf