نتایج جستجو برای: manhattan and euclidean distance

تعداد نتایج: 16850583  

2015
Julio Albinati Gisele L. Pappa Fernando E. B. Otero Luiz Otávio Vilas Boas Oliveira

This paper investigates the impact of geometric semantic crossover operators in a wide range of symbolic regression problems. First, it analyses the impact of using Manhattan and Euclidean distance geometric semantic crossovers in the learning process. Then, it proposes two strategies to numerically optimize the crossover mask based on mathematical properties of these operators, instead of simp...

2004
Marc Benkert Alexander Wolff Florian Widmann

Given a set of nodes in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of nodes, the ratio of the network distance and the Euclidean distance of the two nodes is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-) m...

2016
Andysah Putera Utama Siahaan

Determination of the optimum route is often encountered in daily life. The purpose of the optimum route itself is to find the best trajectory of the two pairs of vertices contained in a map or graph. The search algorithm applied is A*. This algorithm has the evaluation function to assist the search. The function is called heuristic. Two methods which have been introduced as a step to obtain the...

2012
H. B. Kekre Vaishali Kulkarni Prashant Gaikar Nishant Gupta J. M. Naik C. Fredouille G. Gravier I. Magrin-Chagnolleau S. Meignier T. Merlin J. Ortega-García D. Petrovska-Delacrétaz Joseph P. Campbell P. B. Denes J. M. Pickett Tanuja K. Sarode Shachi J. Natu Prachi J. Natu Tanuja Sarode Shachi Natu Prachi Natu

In this paper, a text dependent speaker recognition algorithm based on spectrogram is proposed. The spectrograms have been generated using Discrete Fourier Transform for varying frame sizes with 25% and 50% overlap between speech frames. Feature vector extraction has been done by using the row mean vector of the spectrograms. For feature matching, two distance measures, namely Euclidean distanc...

Journal: :Comput. Geom. 2006
Marc Benkert Alexander Wolff Florian Widmann Takeshi Shirabe

Given a set of points in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of points, the ratio of the network distance and the Euclidean distance of the two points is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-...

Journal: :Xinan Jiaotong Daxue Xuebao 2021

This study wants to compare the Integrated Cluster Analysis and SEM model of Warp-PLS approach with various cluster validity indices distance measures on Service Quality, Environment, Fashions, Willingness Pay, Compliant Paying Behavior Bank X Customers. The data used in this are primary. variables service quality, environment, fashion, willingness pay, compliance paying behavior at X. were obt...

2002
Manesh Kokare

The rapid expansion of the Internet and the wide use of digital data have increased the need for both efficient image database creation and retrieval procedure. The challenge in image retrieval is to develop methods that can capture the important characteristics of an image, which makes it unique, and allow its accurate identification. The focus of this paper is on the image processing aspects ...

Journal: :Intelligent Automation & Soft Computing 2004
Zhibin Pan Tadahiro Ohmi Koji Kotani

Vector quantization (VQ) is a well-known method for image compression but its encoding process is very heavy computationally. In order to speed up VQ encoding, it is most important to avoid unnecessary Euclidean distance computations (k-D) as much as possible by a lighter (no multiplication operation) difference check first that uses simpler features (low dimensional) while the searching is goi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید