The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 241 –
260 of
407
The goal of this paper is to present all algorithm for pattern recognition, leveraging on an existing fuzzy clustering algorithm developed by Del Amo et al. [3, 5], and modifying it to its supervised version, in order to apply the algorithm to different pattern recognition applications in Remote Sensing. The main goal is to recognize the object and stop the search depending on the precision of the application. The referred algorithm was the core of a classification system based on Fuzzy Sets Theory...
The aim of this work is to introduce and to analyze new algorithms for solving the
transport neutronique equation in 2D geometry. These algorithms present the duplicate favors to be,
on the one hand faster than some classic algorithms and easily to be implemented and naturally
deviced for parallelisation on the other hand. They are based on a splitting of the collision operator
holding amount of caracteristics of the transport operator. Some numerical results are given at the end
of this work.
...
The bandwidth minimization problem is of significance in network communication and related areas. Let G be a graph of n vertices. The two-dimensional bandwidth B2(G) of G is the minimum value of the maximum distance between adjacent vertices when G is embedded into an n × n grid in the plane. As a discrete optimization problem, determining B2(G) is NP-hard in general. However, exact results for this parameter can be derived for some special classes of graphs. This paper studies the “square-root...
The bandwidth minimization problem is of significance in network communication and related areas. Let G be a graph of n vertices. The two-dimensional bandwidth B2(G) of G is the minimum value of the maximum distance between adjacent vertices when G is embedded into an n × n grid in the plane. As a discrete optimization problem, determining B2(G) is NP-hard in general. However, exact results for this parameter can be derived for some special classes of graphs. This paper studies the “square-root...
We prove that every Sturmian word ω has infinitely many prefixes of
the form UnVn3, where |Un| < 2.855|Vn| and
limn→∞|Vn| = ∞. In passing, we give a very simple proof of the
known fact that every Sturmian word begins in arbitrarily long squares.
We consider the position and number of occurrences of squares
in the Thue-Morse sequence, and show that the corresponding sequences
are 2-regular. We also prove that changing any finite but nonzero
number of bits in the Thue-Morse sequence creates an overlap, and any
linear subsequence of the Thue-Morse sequence (except those corresponding
to decimation by a power of 2) contains an overlap.
We show stability and consistency of the linear semi-implicit complementary volume numerical scheme for solving the regularized, in the sense of Evans and Spruck, mean curvature flow equation in the level set formulation. The numerical method is based on the finite volume methodology using the so-called complementary volumes to a finite element triangulation. The scheme gives the solution in an efficient and unconditionally stable way.
This paper examines appropriate protocols for high speed multiple access communication systems where the bandwidth is divided into two separate asymmetric channels. Both channels operate using slotted non-persistent CSMA or CSMA/CD techniques. Free stations access the first channel while all retransmissions occur in the second channel. We define the stability regions and the rules for optimal bandwidth allocation among the two channels for improvement of the system performance in case of infinite...
Currently displaying 241 –
260 of
407