Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Existing niching techniques commonly use the Euclidean distance metric in the decision space for the classification of feasible solutions to the niches under formation. This approa...
In text-dependent speaker verification the speech signals have to be time-aligned. For that purpose dynamic time warping (DTW) can be used which performs the alignment by minimizi...
Experimental results of applying two similarity measurements, Euclidean distance and chord distance, to test a set of six Brodatz’s textures are reported. Experiments show that ...
We investigate a practical approach to solving one instantiation of a distributed hypothesis testing problem under severe rate constraints that shows up in a wide variety of appli...