Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Manhattan distance). Showing records 1 – 7 of 7 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


NSYSU

1. Hung, Hsiu-Chieh. A Prune-and-Search Algorithm for Finding the Most Similar Sequence.

Degree: Master, Institute Of Computer Science And Engineering, 2018, NSYSU

 For finding the most similar sequence in a character-sequence database, it is very time-consuming if the one-by-one sequential search strategy is applied. In the previous… (more)

Subjects/Keywords: L1-norm; Manhattan distance; triangle inequality; character-sequence database; edit distance; the most similar sequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hung, H. (2018). A Prune-and-Search Algorithm for Finding the Most Similar Sequence. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hung, Hsiu-Chieh. “A Prune-and-Search Algorithm for Finding the Most Similar Sequence.” 2018. Thesis, NSYSU. Accessed April 11, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hung, Hsiu-Chieh. “A Prune-and-Search Algorithm for Finding the Most Similar Sequence.” 2018. Web. 11 Apr 2021.

Vancouver:

Hung H. A Prune-and-Search Algorithm for Finding the Most Similar Sequence. [Internet] [Thesis]. NSYSU; 2018. [cited 2021 Apr 11]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hung H. A Prune-and-Search Algorithm for Finding the Most Similar Sequence. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Colorado State University

2. Dinkins, Stephanie. Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A.

Degree: MS(M.S.), Computer Science, 2012, Colorado State University

 Sparse matrix vector multiply (SpMV) is an important computation that is used in many scientific and structural engineering applications. Sparse computations like SpMV require the… (more)

Subjects/Keywords: data locality; Manhattan distance; performance model; sparse matrices; sparse matrix vector multiply; SpMV

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dinkins, S. (2012). Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/65303

Chicago Manual of Style (16th Edition):

Dinkins, Stephanie. “Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A.” 2012. Masters Thesis, Colorado State University. Accessed April 11, 2021. http://hdl.handle.net/10217/65303.

MLA Handbook (7th Edition):

Dinkins, Stephanie. “Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A.” 2012. Web. 11 Apr 2021.

Vancouver:

Dinkins S. Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A. [Internet] [Masters thesis]. Colorado State University; 2012. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/10217/65303.

Council of Science Editors:

Dinkins S. Model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality, A. [Masters Thesis]. Colorado State University; 2012. Available from: http://hdl.handle.net/10217/65303

3. Zhou, Yi. Exploiting Structural Regularities and Beyond: Vision-based Localization and Mapping in Man-Made Environments .

Degree: 2018, Australian National University

 Image-based estimation of camera motion, known as visual odometry (VO), plays a very important role in many robotic applications such as control and navigation of… (more)

Subjects/Keywords: Visual Odometry (VO); Piece-wise Planar Environment; Manhattan World; Distribution Alignment; RGB-D Camera; 3D-2D Registration; Distance Transform; Event Camera

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhou, Y. (2018). Exploiting Structural Regularities and Beyond: Vision-based Localization and Mapping in Man-Made Environments . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/155255

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zhou, Yi. “Exploiting Structural Regularities and Beyond: Vision-based Localization and Mapping in Man-Made Environments .” 2018. Thesis, Australian National University. Accessed April 11, 2021. http://hdl.handle.net/1885/155255.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zhou, Yi. “Exploiting Structural Regularities and Beyond: Vision-based Localization and Mapping in Man-Made Environments .” 2018. Web. 11 Apr 2021.

Vancouver:

Zhou Y. Exploiting Structural Regularities and Beyond: Vision-based Localization and Mapping in Man-Made Environments . [Internet] [Thesis]. Australian National University; 2018. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/1885/155255.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhou Y. Exploiting Structural Regularities and Beyond: Vision-based Localization and Mapping in Man-Made Environments . [Thesis]. Australian National University; 2018. Available from: http://hdl.handle.net/1885/155255

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Ranjitkar, Hari Sagar. Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man.

Degree: 2016, , Department of Computer Science and Engineering

  Context An influence map and potential fields are used for finding path in domain of Robotics and Gaming in AI. Various distance measures can… (more)

Subjects/Keywords: Ms. Pac-Man; algorithm; influence maps; potential fields; distance measure; A*; Euclidean; Manhattan; optimal parameter space; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ranjitkar, H. S. (2016). Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man. (Thesis). , Department of Computer Science and Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11800

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ranjitkar, Hari Sagar. “Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man.” 2016. Thesis, , Department of Computer Science and Engineering. Accessed April 11, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11800.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ranjitkar, Hari Sagar. “Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man.” 2016. Web. 11 Apr 2021.

Vancouver:

Ranjitkar HS. Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man. [Internet] [Thesis]. , Department of Computer Science and Engineering; 2016. [cited 2021 Apr 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11800.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ranjitkar HS. Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man. [Thesis]. , Department of Computer Science and Engineering; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-11800

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université de Montréal

5. Vanier, Mathieu. La route qui mène au crime : déterminants de la mobilité des infracteurs de Gatineau en 2006.

Degree: 2009, Université de Montréal

Subjects/Keywords: Déplacements criminels; Journey-to-crime; Distance euclidienne; Euclidean distance; Distance Manhattan; Manhattan distance; Distance routière; Road Distance; Banlieue; Suburb; Criminologie environnementale; Environmental criminology; Géocriminologie; Geocriminology; Sociology - Criminology and Penology / Sociologie - Criminologie et établissements pénitentiaires (UMI : 0627)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vanier, M. (2009). La route qui mène au crime : déterminants de la mobilité des infracteurs de Gatineau en 2006. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/3219

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vanier, Mathieu. “La route qui mène au crime : déterminants de la mobilité des infracteurs de Gatineau en 2006.” 2009. Thesis, Université de Montréal. Accessed April 11, 2021. http://hdl.handle.net/1866/3219.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vanier, Mathieu. “La route qui mène au crime : déterminants de la mobilité des infracteurs de Gatineau en 2006.” 2009. Web. 11 Apr 2021.

Vancouver:

Vanier M. La route qui mène au crime : déterminants de la mobilité des infracteurs de Gatineau en 2006. [Internet] [Thesis]. Université de Montréal; 2009. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/1866/3219.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vanier M. La route qui mène au crime : déterminants de la mobilité des infracteurs de Gatineau en 2006. [Thesis]. Université de Montréal; 2009. Available from: http://hdl.handle.net/1866/3219

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

6. Sporni, Alex. Analýza DNS dat pro účely identifikace mobilních zařízení: DNS Data Analysis for Mobile Device Identification Purposes.

Degree: 2020, Brno University of Technology

 This bachelor's thesis deals with the problem of identification of mobile devices based on DNS data analysis. The thesis provides a theoretical introduction to the computer… (more)

Subjects/Keywords: Dolovanie dát; analýza dát; metodológia; TF-IDF; kosínusová podobnosť; dátové sady; protokol DNS; mobilné zariadenia; identifikácia; Euklidovská vzdialenosť; Manhattanovská vzdialenosť; Minkowského vzdialenosť; Chebyshevova vzdialenosť; váhovanie; vektorový model; Python; MySQL; techniky spracovania dát; model OSI; model TCP/IP; DNS záznamy; Data mining; data analysis; methodology; TF-IDF; cosine similarity; data sets; DNS protocol; mobile devices; identification; Euclidean distance; Manhattan distance; Minkowski distance; Chebyshev distance; weighting; vector space model; Python; MySQL; data processing techniques; OSI model; TCP/IP model; DNS resource records

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sporni, A. (2020). Analýza DNS dat pro účely identifikace mobilních zařízení: DNS Data Analysis for Mobile Device Identification Purposes. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/191456

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sporni, Alex. “Analýza DNS dat pro účely identifikace mobilních zařízení: DNS Data Analysis for Mobile Device Identification Purposes.” 2020. Thesis, Brno University of Technology. Accessed April 11, 2021. http://hdl.handle.net/11012/191456.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sporni, Alex. “Analýza DNS dat pro účely identifikace mobilních zařízení: DNS Data Analysis for Mobile Device Identification Purposes.” 2020. Web. 11 Apr 2021.

Vancouver:

Sporni A. Analýza DNS dat pro účely identifikace mobilních zařízení: DNS Data Analysis for Mobile Device Identification Purposes. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2021 Apr 11]. Available from: http://hdl.handle.net/11012/191456.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sporni A. Analýza DNS dat pro účely identifikace mobilních zařízení: DNS Data Analysis for Mobile Device Identification Purposes. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/191456

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Singh, Rupesh Kumar. Distance Learning and Attribute Importance Analysis by Linear Regression on Idealized Distance Functions.

Degree: MSCE, Computer Engineering, 2017, Wright State University

 A good distance metric is instrumental on the performance of many tasks including classification and data retrieval. However, designing an optimal distance function is very… (more)

Subjects/Keywords: Computer Engineering; Computer Science; Distance learning; move bad neighbors out; global class gap; two-constant distance; weighted distance function; Euclidean; Manhattan

…the training dataset. Along with it, Euclidean and Manhattan distance functions give equal… …employing Euclidean or Manhattan distance functions. Here, in this thesis, we focus on choosing… …Manhattan distance functions. Idealized distance is calculated based on two approach: error… …going to use Euclidean and Manhattan. Euclidean distance metric is also known as L2 norm… …number of attributes. Manhattan distance metric is also known as rectilinear distance or L1… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Singh, R. K. (2017). Distance Learning and Attribute Importance Analysis by Linear Regression on Idealized Distance Functions. (Masters Thesis). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1495909607902884

Chicago Manual of Style (16th Edition):

Singh, Rupesh Kumar. “Distance Learning and Attribute Importance Analysis by Linear Regression on Idealized Distance Functions.” 2017. Masters Thesis, Wright State University. Accessed April 11, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=wright1495909607902884.

MLA Handbook (7th Edition):

Singh, Rupesh Kumar. “Distance Learning and Attribute Importance Analysis by Linear Regression on Idealized Distance Functions.” 2017. Web. 11 Apr 2021.

Vancouver:

Singh RK. Distance Learning and Attribute Importance Analysis by Linear Regression on Idealized Distance Functions. [Internet] [Masters thesis]. Wright State University; 2017. [cited 2021 Apr 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1495909607902884.

Council of Science Editors:

Singh RK. Distance Learning and Attribute Importance Analysis by Linear Regression on Idealized Distance Functions. [Masters Thesis]. Wright State University; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1495909607902884

.