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

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

2013
Bodo Manthey Rianne Veenstra

The 2-opt heuristic is a very simple local search heuristic for the traveling salesman problem. While it usually converges quickly in practice, its running-time can be exponential in the worst case. In order to explain the performance of 2-opt, Englert, Röglin, and Vöcking (Algorithmica, to appear) provided a smoothed analysis in the so-called one-step model on d-dimensional Euclidean instances...

2010
Gordana Pavlovic-Lazetic Jelena Graovac

Document classification based on the lexical-semantic network, wordnet, is presented. Two types of document classification in Serbian have been experimented with – classification based on chosen concepts from Serbian WordNet (SWN) and proper names-based classification. Conceptual document classification criteria are constructed from hierarchies rooted in a set of chosen concepts (first case) or...

2007
Alberto Moraglio Cecilia Di Chio Riccardo Poli

Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimization (PSO) and evolutionary algorithms. This connection enables us to generalize PSO to virtually any solution representation in a natural and straightforward way. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces.

2007
Jérôme Revaud Guillaume Lavoué Atilla Baskurt

This paper presents a novel and robust algorithm that retrieves the rotation angle between two different patterns, together with their similarity degree. The result is optimal in the sense that it minimizes the euclidean distance between the two images. This approach is based on Zernike moments and constitutes a new way to compare two Zernike descriptors that improves standard Euclidean approac...

2013
Cong Xie Hui Lei Xing Xu Weifeng Chen Haidong Chen Jinsong Yang Danfang Yan Wei Chen Senxiang Yan

基金项目:本项目得到国家自然科学基金项目(81170118、61003193)、湖南省科技计划资助项目(2010GK3064)、国家“八六三”高技术 研究发展计划(2012AA120903)、浙江省科技厅公益项目(No.2011C21058)的资助。 作者简介:解聪(1989—),男,硕士研究生,主要研究方向为医学影像可视化;雷辉(1977-),女,讲师,硕士,主要研究方向:图像 处理,小波分析;徐星(1987—),男,硕士研究生,主要研究方向为医学影像可视化;陈伟锋(1983—),男,博士,主要研究方向为科 学计算可视化;陈海东(1987—),男,博士,主要研究方向为科学计算可视化;杨劲松(1974—),男,博士,主要研究方向为放射学及 放射肿瘤学的基础临床研究;严丹方(1984—),女,硕士研究生,主要研究方向为放射学及放射肿瘤学的基础临床研究;陈为(1976—), 男,博士,教...

2016
PP Barnali Goswami Sanjay Goswami

One of the preliminary works in the field of flood prediction, due to heavy rainfall, is the detection and identification of convective clouds using satellite imagery. Thermal infra-red (TIR) band images have been extensively used for this purpose. In order to identify the convective cloud, the image has to be clustered so that cloudy pixels can be identified. In this paper k-means clustering h...

Journal: :Bioinformatics 2011
Seongho Kim Aiqin Fang Bing Wang Jaesik Jeong Xiang Zhang

MOTIVATION Comprehensive two-dimensional gas chromatography mass spectrometry (GC × GC-MS) brings much increased separation capacity, chemical selectivity and sensitivity for metabolomics and provides more accurate information about metabolite retention times and mass spectra. However, there is always a shift of retention times in the two columns that makes it difficult to compare metabolic pro...

2012
M. Gomathy K. Meena K. R. Subramaniam Sreenivasa Rao Ramu Reddy Sudhamay Maity Shashidhar G Koolagudi Stephen J. Cox Yakun Hu Dapeng Wu H. Meinedo M. Bugalho A. Abad Hugo Meinedo Arnulf B. A. Graf Felix A. Wichmann

In speech processing gender clustering and classification is the most outstanding and challenging task. In both gender clustering and classification, one the most vital processes carried out is the selection of features. In speech processing, pitch is the most often used feature for gender clustering and classification. It is essential to note that compared to a female speech the pitch value of...

Journal: :Theoretical Computer Science 2021

Motivated by (continuous) facility location, we study the problem of dispersing and grouping points on a set segments (of streets) in plane. In former problem, given n disjoint line plane, investigate computing point each such that minimum Euclidean distance between any two these is maximized. We prove this 2D dispersion NP-hard, fact, it NP-hard even if all are parallel unit length. This contr...

Journal: :Journal of Engineering and Applied Technology 2021

K-Nearest Neighbor (K-NN) algorithm is a classification that has been proven to solve various problems. Two approaches can be used in this are K-NN with Euclidean and Manhattan. The research aims apply the Manhattan classify accuracy of graduation. Student graduation determined by variables gender, major, number first-semester credits, second-semester third-semester grade point on first semeste...

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

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