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

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

2016
A. S. Narote L. M. Waghmare

This paper proposes performance evaluation of different distance measures used in color iris authentication. The color iris segmentation is carried out using histogram and circular Hough transform. The color iris features are extracted using histogram method. Different distance measures are used for iris authentication. The experimental evaluation shows that Euclidean and Manhattan distance are...

Journal: :American journal of health promotion : AJHP 2018
Alen Agaronov May May Leung Jeanette M Garcia Amy Kwan Ming-Chin Yeh Christina Zarcadoolas Charles S Platkin

PURPOSE To test the feasibility and reliability of a direct observation method for measuring moderate to vigorous physical activity (MVPA) in children visiting an interactive children's museum exhibition. DESIGN Direct observation was used to assess MVPA in children visiting an interactive children's museum exhibition on 2 weekend days in winter 2013. SETTING The Children's Museum of Manhat...

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-...

2017
Trudie Strauss Michael Johan von Maltitz

The claim that Ward's linkage algorithm in hierarchical clustering is limited to use with Euclidean distances is investigated. In this paper, Ward's clustering algorithm is generalised to use with l1 norm or Manhattan distances. We argue that the generalisation of Ward's linkage method to incorporate Manhattan distances is theoretically sound and provide an example of where this method outperfo...

2007
Joachim Gudmundsson Oliver Klein Christian Knauer Michiel Smid

Given a set S of n points in the plane, a Manhattan network on S is a (not necessarily planar) rectilinear network G with the property that for every pair of points in S the network G contains a path between them whose length is equal to the Manhattan distance between the points. A Manhattan network on S can be thought of as a graph G = (V,E) where the vertex set V corresponds to the points of ...

Journal: :Journal of Combinatorial Theory, Series A 2019

Journal: :Physica A: Statistical Mechanics and its Applications 1997

Journal: :International Journal of Electrical and Computer Engineering (IJECE) 2017

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

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