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:(Path clustering). Showing records 1 – 25 of 25 total matches.

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Windsor

1. Mendonca, Pramod. C – THETA* : PATH PLANNING ON GRIDS.

Degree: MS, Computer Science, 2016, University of Windsor

 Finding the shortest path between two points on a given grid map is called path finding. Many algorithms have been devised, but the most widely… (more)

Subjects/Keywords: clustering; path finding; path planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mendonca, P. (2016). C – THETA* : PATH PLANNING ON GRIDS. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5654

Chicago Manual of Style (16th Edition):

Mendonca, Pramod. “C – THETA* : PATH PLANNING ON GRIDS.” 2016. Masters Thesis, University of Windsor. Accessed August 05, 2020. https://scholar.uwindsor.ca/etd/5654.

MLA Handbook (7th Edition):

Mendonca, Pramod. “C – THETA* : PATH PLANNING ON GRIDS.” 2016. Web. 05 Aug 2020.

Vancouver:

Mendonca P. C – THETA* : PATH PLANNING ON GRIDS. [Internet] [Masters thesis]. University of Windsor; 2016. [cited 2020 Aug 05]. Available from: https://scholar.uwindsor.ca/etd/5654.

Council of Science Editors:

Mendonca P. C – THETA* : PATH PLANNING ON GRIDS. [Masters Thesis]. University of Windsor; 2016. Available from: https://scholar.uwindsor.ca/etd/5654


University of Waterloo

2. Imeson, Frank. Robotic Path Planning for High-Level Tasks in Discrete Environments.

Degree: 2018, University of Waterloo

 This thesis proposes two techniques for solving high-level multi-robot motion planning problems with discrete environments. We focus on an important class of problems that require… (more)

Subjects/Keywords: Robotics; Path Planning; Satisfiability Modulo Theories; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Imeson, F. (2018). Robotic Path Planning for High-Level Tasks in Discrete Environments. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13082

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):

Imeson, Frank. “Robotic Path Planning for High-Level Tasks in Discrete Environments.” 2018. Thesis, University of Waterloo. Accessed August 05, 2020. http://hdl.handle.net/10012/13082.

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

MLA Handbook (7th Edition):

Imeson, Frank. “Robotic Path Planning for High-Level Tasks in Discrete Environments.” 2018. Web. 05 Aug 2020.

Vancouver:

Imeson F. Robotic Path Planning for High-Level Tasks in Discrete Environments. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10012/13082.

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

Council of Science Editors:

Imeson F. Robotic Path Planning for High-Level Tasks in Discrete Environments. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13082

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


University of California – Riverside

3. Schuberg, Edward. Solution Path Clustering with Robust Loss and Concave Penalty.

Degree: Applied Statistics, 2019, University of California – Riverside

 The main purpose of this dissertation is to demonstrate that using a robust loss function (instead of the usual least squares loss) improves the clustering(more)

Subjects/Keywords: Statistics; admm; bic; convex clustering; irls; robust; solution path clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schuberg, E. (2019). Solution Path Clustering with Robust Loss and Concave Penalty. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/6kk6628s

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):

Schuberg, Edward. “Solution Path Clustering with Robust Loss and Concave Penalty.” 2019. Thesis, University of California – Riverside. Accessed August 05, 2020. http://www.escholarship.org/uc/item/6kk6628s.

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

MLA Handbook (7th Edition):

Schuberg, Edward. “Solution Path Clustering with Robust Loss and Concave Penalty.” 2019. Web. 05 Aug 2020.

Vancouver:

Schuberg E. Solution Path Clustering with Robust Loss and Concave Penalty. [Internet] [Thesis]. University of California – Riverside; 2019. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/6kk6628s.

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

Council of Science Editors:

Schuberg E. Solution Path Clustering with Robust Loss and Concave Penalty. [Thesis]. University of California – Riverside; 2019. Available from: http://www.escholarship.org/uc/item/6kk6628s

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


Virginia Commonwealth University

4. Donachy, Shaun. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.

Degree: MS, Computer Science, 2015, Virginia Commonwealth University

  Networks of spiking neurons can be used not only for brain modeling but also to solve graph problems. With the use of a computationally… (more)

Subjects/Keywords: Spiking Neural Networks; Plasticity; Shortest Path; Graph Clustering; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Donachy, S. (2015). Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. (Thesis). Virginia Commonwealth University. Retrieved from https://doi.org/10.25772/D6AZ-JB33 ; https://scholarscompass.vcu.edu/etd/3984

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):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Thesis, Virginia Commonwealth University. Accessed August 05, 2020. https://doi.org/10.25772/D6AZ-JB33 ; https://scholarscompass.vcu.edu/etd/3984.

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

MLA Handbook (7th Edition):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Web. 05 Aug 2020.

Vancouver:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Internet] [Thesis]. Virginia Commonwealth University; 2015. [cited 2020 Aug 05]. Available from: https://doi.org/10.25772/D6AZ-JB33 ; https://scholarscompass.vcu.edu/etd/3984.

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

Council of Science Editors:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Thesis]. Virginia Commonwealth University; 2015. Available from: https://doi.org/10.25772/D6AZ-JB33 ; https://scholarscompass.vcu.edu/etd/3984

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


Oklahoma State University

5. Thippiereddy, Suresh Babu. Models for evolution and joining of small world networks.

Degree: Computer Science Department, 2009, Oklahoma State University

 Social networks are characterized by various properties related to clustering of nodes and the degree of separation amongst nodes. The small world network model of… (more)

Subjects/Keywords: average path length; clustering coefficient; small world networks; social networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thippiereddy, S. B. (2009). Models for evolution and joining of small world networks. (Thesis). Oklahoma State University. Retrieved from http://hdl.handle.net/11244/8255

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):

Thippiereddy, Suresh Babu. “Models for evolution and joining of small world networks.” 2009. Thesis, Oklahoma State University. Accessed August 05, 2020. http://hdl.handle.net/11244/8255.

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

MLA Handbook (7th Edition):

Thippiereddy, Suresh Babu. “Models for evolution and joining of small world networks.” 2009. Web. 05 Aug 2020.

Vancouver:

Thippiereddy SB. Models for evolution and joining of small world networks. [Internet] [Thesis]. Oklahoma State University; 2009. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/11244/8255.

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

Council of Science Editors:

Thippiereddy SB. Models for evolution and joining of small world networks. [Thesis]. Oklahoma State University; 2009. Available from: http://hdl.handle.net/11244/8255

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


University of North Texas

6. Dharmavaram, Sirisha. Mining Biomedical Data for Hidden Relationship Discovery.

Degree: 2019, University of North Texas

 With an ever-growing number of publications in the biomedical domain, it becomes likely that important implicit connections between individual concepts of biomedical knowledge are overlooked.… (more)

Subjects/Keywords: Literature Based Discovery; Representation; Learning; Path Clustering; Semantic Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dharmavaram, S. (2019). Mining Biomedical Data for Hidden Relationship Discovery. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc1538709/

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):

Dharmavaram, Sirisha. “Mining Biomedical Data for Hidden Relationship Discovery.” 2019. Thesis, University of North Texas. Accessed August 05, 2020. https://digital.library.unt.edu/ark:/67531/metadc1538709/.

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

MLA Handbook (7th Edition):

Dharmavaram, Sirisha. “Mining Biomedical Data for Hidden Relationship Discovery.” 2019. Web. 05 Aug 2020.

Vancouver:

Dharmavaram S. Mining Biomedical Data for Hidden Relationship Discovery. [Internet] [Thesis]. University of North Texas; 2019. [cited 2020 Aug 05]. Available from: https://digital.library.unt.edu/ark:/67531/metadc1538709/.

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

Council of Science Editors:

Dharmavaram S. Mining Biomedical Data for Hidden Relationship Discovery. [Thesis]. University of North Texas; 2019. Available from: https://digital.library.unt.edu/ark:/67531/metadc1538709/

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


Rochester Institute of Technology

7. Meinhold, Renee T. Robust Path-based Image Segmentation Using Superpixel Denoising.

Degree: MS, School of Mathematical Sciences (COS), 2018, Rochester Institute of Technology

Clustering is the important task of partitioning data into groups with similar characteristics, with one category being spectral clustering where data points are represented… (more)

Subjects/Keywords: Image segmentation; Out-of-sample extension; Path-based distance; Spectral clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meinhold, R. T. (2018). Robust Path-based Image Segmentation Using Superpixel Denoising. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9893

Chicago Manual of Style (16th Edition):

Meinhold, Renee T. “Robust Path-based Image Segmentation Using Superpixel Denoising.” 2018. Masters Thesis, Rochester Institute of Technology. Accessed August 05, 2020. https://scholarworks.rit.edu/theses/9893.

MLA Handbook (7th Edition):

Meinhold, Renee T. “Robust Path-based Image Segmentation Using Superpixel Denoising.” 2018. Web. 05 Aug 2020.

Vancouver:

Meinhold RT. Robust Path-based Image Segmentation Using Superpixel Denoising. [Internet] [Masters thesis]. Rochester Institute of Technology; 2018. [cited 2020 Aug 05]. Available from: https://scholarworks.rit.edu/theses/9893.

Council of Science Editors:

Meinhold RT. Robust Path-based Image Segmentation Using Superpixel Denoising. [Masters Thesis]. Rochester Institute of Technology; 2018. Available from: https://scholarworks.rit.edu/theses/9893


University of Manitoba

8. Niknam, Mehdi. LPR: an adaptive learning path recommendation system using ACO and meaningful learning theory.

Degree: Computer Science, 2017, University of Manitoba

 In recent years, the educational community has been interested in enabled learning systems. That is, having a personalized learning system that can adapt itself while… (more)

Subjects/Keywords: Ant Colony Optimization; Learning path recommendation; Content planning; Content sequencing; Fuzzy C-Mean Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Niknam, M. (2017). LPR: an adaptive learning path recommendation system using ACO and meaningful learning theory. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/32453

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):

Niknam, Mehdi. “LPR: an adaptive learning path recommendation system using ACO and meaningful learning theory.” 2017. Thesis, University of Manitoba. Accessed August 05, 2020. http://hdl.handle.net/1993/32453.

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

MLA Handbook (7th Edition):

Niknam, Mehdi. “LPR: an adaptive learning path recommendation system using ACO and meaningful learning theory.” 2017. Web. 05 Aug 2020.

Vancouver:

Niknam M. LPR: an adaptive learning path recommendation system using ACO and meaningful learning theory. [Internet] [Thesis]. University of Manitoba; 2017. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/1993/32453.

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

Council of Science Editors:

Niknam M. LPR: an adaptive learning path recommendation system using ACO and meaningful learning theory. [Thesis]. University of Manitoba; 2017. Available from: http://hdl.handle.net/1993/32453

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

9. Touray, Barra. Energy-efficient routing algorithms for wireless sensor networks.

Degree: PhD, 2013, Liverpool John Moores University

 A wireless sensor network (WSN) is made of tiny sensor nodes usually deployed in high density within a targeted area to monitor a phenomenon of… (more)

Subjects/Keywords: 621.382; biased random walk, routing algorithm, clustering, energy efficient, shortest path first, wireless sensor network.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Touray, B. (2013). Energy-efficient routing algorithms for wireless sensor networks. (Doctoral Dissertation). Liverpool John Moores University. Retrieved from http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282

Chicago Manual of Style (16th Edition):

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Doctoral Dissertation, Liverpool John Moores University. Accessed August 05, 2020. http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

MLA Handbook (7th Edition):

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Web. 05 Aug 2020.

Vancouver:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Internet] [Doctoral dissertation]. Liverpool John Moores University; 2013. [cited 2020 Aug 05]. Available from: http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

Council of Science Editors:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Doctoral Dissertation]. Liverpool John Moores University; 2013. Available from: http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282


University of Queensland

10. Annuar, Noralifah. Mobile sink for data collection in wireless sensor networks.

Degree: School of Information Technology and Electrical Engineering, 2019, University of Queensland

 The work in this thesis investigates the problem of designing a path for a mobile sink, like an Unpiloted Aerial Vehicle (UAV), to traverse a… (more)

Subjects/Keywords: Clustering; Energy efficiency; Path planning; Wireless sensor network; 0805 Distributed Computing; 0806 Information Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Annuar, N. (2019). Mobile sink for data collection in wireless sensor networks. (Thesis). University of Queensland. Retrieved from https://espace.library.uq.edu.au/view/UQ:a1e336e/s43672208_final_thesis.pdf ; https://espace.library.uq.edu.au/view/UQ:a1e336e

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):

Annuar, Noralifah. “Mobile sink for data collection in wireless sensor networks.” 2019. Thesis, University of Queensland. Accessed August 05, 2020. https://espace.library.uq.edu.au/view/UQ:a1e336e/s43672208_final_thesis.pdf ; https://espace.library.uq.edu.au/view/UQ:a1e336e.

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

MLA Handbook (7th Edition):

Annuar, Noralifah. “Mobile sink for data collection in wireless sensor networks.” 2019. Web. 05 Aug 2020.

Vancouver:

Annuar N. Mobile sink for data collection in wireless sensor networks. [Internet] [Thesis]. University of Queensland; 2019. [cited 2020 Aug 05]. Available from: https://espace.library.uq.edu.au/view/UQ:a1e336e/s43672208_final_thesis.pdf ; https://espace.library.uq.edu.au/view/UQ:a1e336e.

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

Council of Science Editors:

Annuar N. Mobile sink for data collection in wireless sensor networks. [Thesis]. University of Queensland; 2019. Available from: https://espace.library.uq.edu.au/view/UQ:a1e336e/s43672208_final_thesis.pdf ; https://espace.library.uq.edu.au/view/UQ:a1e336e

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

11. Kuruppumullage Don, Prabhani. EVOLUTION CHARACTERISTICS OF ENSEMBLE FORECASTS THROUGH.

Degree: MS, Statistics, 2011, Penn State University

 Tropical and extra-tropical cyclones pose considerable societal risks, especially to the increasing populations living near the coasts. As a result, they have been studied since… (more)

Subjects/Keywords: ensemble forecasts; path clustering; Model-based clustering; cyclones

…period we use model-based path clustering of ensemble paths (chapter 3). Note that a… …apply point and path clustering methodologies to the European Centre for Medium-Range Weather… …we will explain in detail how we used model-based point and path clustering methodologies… …Application of Model-Based Path Clustering 3.1 Grouping Ensemble Generated Paths in the Physical… …planning, insurance, and many more, the interest in clustering has increased recently. Most… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kuruppumullage Don, P. (2011). EVOLUTION CHARACTERISTICS OF ENSEMBLE FORECASTS THROUGH. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/11793

Chicago Manual of Style (16th Edition):

Kuruppumullage Don, Prabhani. “EVOLUTION CHARACTERISTICS OF ENSEMBLE FORECASTS THROUGH.” 2011. Masters Thesis, Penn State University. Accessed August 05, 2020. https://etda.libraries.psu.edu/catalog/11793.

MLA Handbook (7th Edition):

Kuruppumullage Don, Prabhani. “EVOLUTION CHARACTERISTICS OF ENSEMBLE FORECASTS THROUGH.” 2011. Web. 05 Aug 2020.

Vancouver:

Kuruppumullage Don P. EVOLUTION CHARACTERISTICS OF ENSEMBLE FORECASTS THROUGH. [Internet] [Masters thesis]. Penn State University; 2011. [cited 2020 Aug 05]. Available from: https://etda.libraries.psu.edu/catalog/11793.

Council of Science Editors:

Kuruppumullage Don P. EVOLUTION CHARACTERISTICS OF ENSEMBLE FORECASTS THROUGH. [Masters Thesis]. Penn State University; 2011. Available from: https://etda.libraries.psu.edu/catalog/11793


University of Notre Dame

12. Shenglong Zhu. Algorithms for Assembly Consolidation and Prediction of Large-Scale Genome Structures</h1>.

Degree: Computer Science and Engineering, 2019, University of Notre Dame

  Genome structure is the order and orientation of pieces of DNA comprising a genome, which contains the information of life. With advances in DNA… (more)

Subjects/Keywords: Genome assembly improvement; Structural error correction; Inversion detection; Approximation algorithms; Operon detection; Bioinformatics; Algorithms; Rectangle clustering; Intra-column exclusive clustering; Maximum alternating path cover; Representative rectangle prediction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, S. (2019). Algorithms for Assembly Consolidation and Prediction of Large-Scale Genome Structures</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/pk02c824t12

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):

Zhu, Shenglong. “Algorithms for Assembly Consolidation and Prediction of Large-Scale Genome Structures</h1>.” 2019. Thesis, University of Notre Dame. Accessed August 05, 2020. https://curate.nd.edu/show/pk02c824t12.

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

MLA Handbook (7th Edition):

Zhu, Shenglong. “Algorithms for Assembly Consolidation and Prediction of Large-Scale Genome Structures</h1>.” 2019. Web. 05 Aug 2020.

Vancouver:

Zhu S. Algorithms for Assembly Consolidation and Prediction of Large-Scale Genome Structures</h1>. [Internet] [Thesis]. University of Notre Dame; 2019. [cited 2020 Aug 05]. Available from: https://curate.nd.edu/show/pk02c824t12.

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

Council of Science Editors:

Zhu S. Algorithms for Assembly Consolidation and Prediction of Large-Scale Genome Structures</h1>. [Thesis]. University of Notre Dame; 2019. Available from: https://curate.nd.edu/show/pk02c824t12

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


University of California – San Diego

13. Babaeian, Amir. Part I - Constrained Shortest-Path For Manifold Learning And Multiple Manifold Clustering Part II - Community Detection In Large Graphs; Analysis, Design And Implementation.

Degree: Mathematics, 2017, University of California – San Diego

 In Part I of this thesis, we address the problem of manifold learning and clustering by introducing a novel constrained shortest-path algorithm. In the case… (more)

Subjects/Keywords: Mathematics; Statistics; Computer science; Community Detection; Constrained-Shortest-Path; Large Graphs; Manifold Learning; MapReduce; Multiple Manifold Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Babaeian, A. (2017). Part I - Constrained Shortest-Path For Manifold Learning And Multiple Manifold Clustering Part II - Community Detection In Large Graphs; Analysis, Design And Implementation. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/4w64w79x

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):

Babaeian, Amir. “Part I - Constrained Shortest-Path For Manifold Learning And Multiple Manifold Clustering Part II - Community Detection In Large Graphs; Analysis, Design And Implementation.” 2017. Thesis, University of California – San Diego. Accessed August 05, 2020. http://www.escholarship.org/uc/item/4w64w79x.

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

MLA Handbook (7th Edition):

Babaeian, Amir. “Part I - Constrained Shortest-Path For Manifold Learning And Multiple Manifold Clustering Part II - Community Detection In Large Graphs; Analysis, Design And Implementation.” 2017. Web. 05 Aug 2020.

Vancouver:

Babaeian A. Part I - Constrained Shortest-Path For Manifold Learning And Multiple Manifold Clustering Part II - Community Detection In Large Graphs; Analysis, Design And Implementation. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2020 Aug 05]. Available from: http://www.escholarship.org/uc/item/4w64w79x.

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

Council of Science Editors:

Babaeian A. Part I - Constrained Shortest-Path For Manifold Learning And Multiple Manifold Clustering Part II - Community Detection In Large Graphs; Analysis, Design And Implementation. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/4w64w79x

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

14. LEONES SHERWIN VIMALRAJ S. Autonomous modulation identification With hamming encoding technique Implemented for sdr;.

Degree: 2015, INFLIBNET

Integrated and differentiated services necessitate the transmission of data using the best modulation technique chosen among the various modulation techniques available The newlineselection is based… (more)

Subjects/Keywords: Software Defined Radio Automatic modulation classification Node tracking Self healing data transmission Shortest path Jitter analysis Adaptive clustering Channel estimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

S, L. S. V. (2015). Autonomous modulation identification With hamming encoding technique Implemented for sdr;. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/45489

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):

S, LEONES SHERWIN VIMALRAJ. “Autonomous modulation identification With hamming encoding technique Implemented for sdr;.” 2015. Thesis, INFLIBNET. Accessed August 05, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/45489.

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

MLA Handbook (7th Edition):

S, LEONES SHERWIN VIMALRAJ. “Autonomous modulation identification With hamming encoding technique Implemented for sdr;.” 2015. Web. 05 Aug 2020.

Vancouver:

S LSV. Autonomous modulation identification With hamming encoding technique Implemented for sdr;. [Internet] [Thesis]. INFLIBNET; 2015. [cited 2020 Aug 05]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/45489.

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

Council of Science Editors:

S LSV. Autonomous modulation identification With hamming encoding technique Implemented for sdr;. [Thesis]. INFLIBNET; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/45489

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

15. Fernandes, Tiago Santos. Planeamento de Trajetória para Operações de Busca e Salvamento com UAVs.

Degree: 2016, Instituto Politécnico do Porto

Os sistemas autónomos trazem como mais valia aos cenários de busca e salvamento a possibilidade de minimizar a presença de Humanos em situações de perigo… (more)

Subjects/Keywords: Planeamento de Trajetórias; Deteção Obstáculos; UAV; Clustering; Octomap; GPRM; PPRM; Path Planning; Obstacle Detection; Sistemas Autónomos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fernandes, T. S. (2016). Planeamento de Trajetória para Operações de Busca e Salvamento com UAVs. (Thesis). Instituto Politécnico do Porto. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/8250

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):

Fernandes, Tiago Santos. “Planeamento de Trajetória para Operações de Busca e Salvamento com UAVs.” 2016. Thesis, Instituto Politécnico do Porto. Accessed August 05, 2020. http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/8250.

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

MLA Handbook (7th Edition):

Fernandes, Tiago Santos. “Planeamento de Trajetória para Operações de Busca e Salvamento com UAVs.” 2016. Web. 05 Aug 2020.

Vancouver:

Fernandes TS. Planeamento de Trajetória para Operações de Busca e Salvamento com UAVs. [Internet] [Thesis]. Instituto Politécnico do Porto; 2016. [cited 2020 Aug 05]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/8250.

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

Council of Science Editors:

Fernandes TS. Planeamento de Trajetória para Operações de Busca e Salvamento com UAVs. [Thesis]. Instituto Politécnico do Porto; 2016. Available from: http://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/8250

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


East Tennessee State University

16. Brooks, Josh Daniel. Nested (2,r)-regular graphs and their network properties.

Degree: MS, Mathematical Sciences, 2012, East Tennessee State University

  A graph <i>G</i> is a (<i>t</i>, <i>r</i>)-regular graph if every collection of <i>t</i> independent vertices is collectively adjacent to exactly <i>r</i> vertices. If a… (more)

Subjects/Keywords: Laplacian matrix; clustering coefficient; average path length; graph theory; Discrete Mathematics and Combinatorics; Mathematics; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brooks, J. D. (2012). Nested (2,r)-regular graphs and their network properties. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/1471

Chicago Manual of Style (16th Edition):

Brooks, Josh Daniel. “Nested (2,r)-regular graphs and their network properties.” 2012. Masters Thesis, East Tennessee State University. Accessed August 05, 2020. https://dc.etsu.edu/etd/1471.

MLA Handbook (7th Edition):

Brooks, Josh Daniel. “Nested (2,r)-regular graphs and their network properties.” 2012. Web. 05 Aug 2020.

Vancouver:

Brooks JD. Nested (2,r)-regular graphs and their network properties. [Internet] [Masters thesis]. East Tennessee State University; 2012. [cited 2020 Aug 05]. Available from: https://dc.etsu.edu/etd/1471.

Council of Science Editors:

Brooks JD. Nested (2,r)-regular graphs and their network properties. [Masters Thesis]. East Tennessee State University; 2012. Available from: https://dc.etsu.edu/etd/1471


Addis Ababa University

17. KASSAYE, NEGASH. STUDIES ON GENETIC DIVERGENCE IN COMMON BEAN (Phaseolus vulgaris L.) INTRODUCTIONS OF ETHIOPIA .

Degree: 2007, Addis Ababa University

 One hundred and forty four common bean (phaseolus vulgaris L.) germplasm introuctions were evaluated for their diversity in 18 agronomic and morphological traits using D2… (more)

Subjects/Keywords: Genetic distance; Genetic diversity; Genetic variability; Germplasms; Correlation; Path coefficient analysis; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

KASSAYE, N. (2007). STUDIES ON GENETIC DIVERGENCE IN COMMON BEAN (Phaseolus vulgaris L.) INTRODUCTIONS OF ETHIOPIA . (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/45

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):

KASSAYE, NEGASH. “STUDIES ON GENETIC DIVERGENCE IN COMMON BEAN (Phaseolus vulgaris L.) INTRODUCTIONS OF ETHIOPIA .” 2007. Thesis, Addis Ababa University. Accessed August 05, 2020. http://etd.aau.edu.et/dspace/handle/123456789/45.

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

MLA Handbook (7th Edition):

KASSAYE, NEGASH. “STUDIES ON GENETIC DIVERGENCE IN COMMON BEAN (Phaseolus vulgaris L.) INTRODUCTIONS OF ETHIOPIA .” 2007. Web. 05 Aug 2020.

Vancouver:

KASSAYE N. STUDIES ON GENETIC DIVERGENCE IN COMMON BEAN (Phaseolus vulgaris L.) INTRODUCTIONS OF ETHIOPIA . [Internet] [Thesis]. Addis Ababa University; 2007. [cited 2020 Aug 05]. Available from: http://etd.aau.edu.et/dspace/handle/123456789/45.

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

Council of Science Editors:

KASSAYE N. STUDIES ON GENETIC DIVERGENCE IN COMMON BEAN (Phaseolus vulgaris L.) INTRODUCTIONS OF ETHIOPIA . [Thesis]. Addis Ababa University; 2007. Available from: http://etd.aau.edu.et/dspace/handle/123456789/45

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

18. Rozo Mendez , Carmen Andrea. Estudio de la organización cerebral en epilepsia a partir de redes complejas obtenidas de registros de electroencefalografía intracraneal.

Degree: 2013, Universidad de los Andes

 El hecho de que las crisis epilépticas se presenten de forma repentina establece un problema para los pacientes que padecen esta enfermedad, reduciendo su calidad… (more)

Subjects/Keywords: Epilepsia; redes complejas; grado de nodos; clustering; mean path length.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rozo Mendez , C. A. (2013). Estudio de la organización cerebral en epilepsia a partir de redes complejas obtenidas de registros de electroencefalografía intracraneal. (Thesis). Universidad de los Andes. Retrieved from http://documentodegrado/documentos/201015972_fecha_2014_01_16_hora_10_58_20_parte_1.pdf

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):

Rozo Mendez , Carmen Andrea. “Estudio de la organización cerebral en epilepsia a partir de redes complejas obtenidas de registros de electroencefalografía intracraneal. ” 2013. Thesis, Universidad de los Andes. Accessed August 05, 2020. http://documentodegrado/documentos/201015972_fecha_2014_01_16_hora_10_58_20_parte_1.pdf.

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

MLA Handbook (7th Edition):

Rozo Mendez , Carmen Andrea. “Estudio de la organización cerebral en epilepsia a partir de redes complejas obtenidas de registros de electroencefalografía intracraneal. ” 2013. Web. 05 Aug 2020.

Vancouver:

Rozo Mendez CA. Estudio de la organización cerebral en epilepsia a partir de redes complejas obtenidas de registros de electroencefalografía intracraneal. [Internet] [Thesis]. Universidad de los Andes; 2013. [cited 2020 Aug 05]. Available from: http://documentodegrado/documentos/201015972_fecha_2014_01_16_hora_10_58_20_parte_1.pdf.

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

Council of Science Editors:

Rozo Mendez CA. Estudio de la organización cerebral en epilepsia a partir de redes complejas obtenidas de registros de electroencefalografía intracraneal. [Thesis]. Universidad de los Andes; 2013. Available from: http://documentodegrado/documentos/201015972_fecha_2014_01_16_hora_10_58_20_parte_1.pdf

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


University of Bath

19. Ba Surra, Shadi Saleh Ali. Collision guided routing for ad hoc mobile wireless networks.

Degree: PhD, 2013, University of Bath

 Ad hoc mobile wireless networks are self-configuring infrastructureless networks of mobile devices connected via wireless links. Each device can send and receive data, but it… (more)

Subjects/Keywords: 681.3845; manet; wmn; clustering algorithms; ad hoc networks; bradcasting; routing; wireless mesh networks; intelligent rebreoadcast algorithms; parallel collision guidance bradcasting; path discovery and social-aware routing protocol

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ba Surra, S. S. A. (2013). Collision guided routing for ad hoc mobile wireless networks. (Doctoral Dissertation). University of Bath. Retrieved from https://researchportal.bath.ac.uk/en/studentthesis/collision-guided-routing-for-ad-hoc-mobile-wireless-networks(36377491-495e-459e-ae43-fe847e5ca388).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735

Chicago Manual of Style (16th Edition):

Ba Surra, Shadi Saleh Ali. “Collision guided routing for ad hoc mobile wireless networks.” 2013. Doctoral Dissertation, University of Bath. Accessed August 05, 2020. https://researchportal.bath.ac.uk/en/studentthesis/collision-guided-routing-for-ad-hoc-mobile-wireless-networks(36377491-495e-459e-ae43-fe847e5ca388).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735.

MLA Handbook (7th Edition):

Ba Surra, Shadi Saleh Ali. “Collision guided routing for ad hoc mobile wireless networks.” 2013. Web. 05 Aug 2020.

Vancouver:

Ba Surra SSA. Collision guided routing for ad hoc mobile wireless networks. [Internet] [Doctoral dissertation]. University of Bath; 2013. [cited 2020 Aug 05]. Available from: https://researchportal.bath.ac.uk/en/studentthesis/collision-guided-routing-for-ad-hoc-mobile-wireless-networks(36377491-495e-459e-ae43-fe847e5ca388).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735.

Council of Science Editors:

Ba Surra SSA. Collision guided routing for ad hoc mobile wireless networks. [Doctoral Dissertation]. University of Bath; 2013. Available from: https://researchportal.bath.ac.uk/en/studentthesis/collision-guided-routing-for-ad-hoc-mobile-wireless-networks(36377491-495e-459e-ae43-fe847e5ca388).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577735

20. Schaeffer, Satu Elisa. Algorithms for Nonuniform Networks.

Degree: 2006, Helsinki University of Technology

In this thesis, observations on structural properties of natural networks are taken as a starting point for developing efficient algorithms for natural instances of different… (more)

Subjects/Keywords: community structure; graph algorithm; graph clustering; graph data mining; graph similarity; local search; minimum spanning tree; network model; nonuniform network; random graph; random sampling; routing; scale-free network; shortest path algorithm; small-world network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schaeffer, S. E. (2006). Algorithms for Nonuniform Networks. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2006/isbn9512281198/

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):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Thesis, Helsinki University of Technology. Accessed August 05, 2020. http://lib.tkk.fi/Diss/2006/isbn9512281198/.

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

MLA Handbook (7th Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Web. 05 Aug 2020.

Vancouver:

Schaeffer SE. Algorithms for Nonuniform Networks. [Internet] [Thesis]. Helsinki University of Technology; 2006. [cited 2020 Aug 05]. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/.

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

Council of Science Editors:

Schaeffer SE. Algorithms for Nonuniform Networks. [Thesis]. Helsinki University of Technology; 2006. Available from: http://lib.tkk.fi/Diss/2006/isbn9512281198/

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

21. Ρέππας, Ανδρέας. Αδρομερής υπολογιστική ανάλυση της δυναμικής μεταδοτικών νόσων: από τα ατομικιστικά-μικροσκοπικά μοντέλα στη μακροσκοπική συμπεριφορά.

Degree: 2011, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

 Over the last years rapid theoretical and technological progress has enhanced our knowledge in fighting epidemics and we are getting constantly better at it. The… (more)

Subjects/Keywords: Μαθηματική επιδημιολογία; Ατομικιστικά, στοχαστικά μοντέλα; Κοινωνικά-επιδημιολογικά δίκτυα; Μεθοδολογία «ελεύθερη εξισώσεων»; Μέσο μήκος και συντελεστής ομάδας δικτύου; Θεωρία διακλαδώσεων; Mathematical epidemiology; Individual-based, stochastic models; Social-epidemic networks; Equation-free computational framework; Mean path length and clustering coefficient of a network; Bifurcation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ρέππας, . . (2011). Αδρομερής υπολογιστική ανάλυση της δυναμικής μεταδοτικών νόσων: από τα ατομικιστικά-μικροσκοπικά μοντέλα στη μακροσκοπική συμπεριφορά. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/27783

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):

Ρέππας, Ανδρέας. “Αδρομερής υπολογιστική ανάλυση της δυναμικής μεταδοτικών νόσων: από τα ατομικιστικά-μικροσκοπικά μοντέλα στη μακροσκοπική συμπεριφορά.” 2011. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed August 05, 2020. http://hdl.handle.net/10442/hedi/27783.

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

MLA Handbook (7th Edition):

Ρέππας, Ανδρέας. “Αδρομερής υπολογιστική ανάλυση της δυναμικής μεταδοτικών νόσων: από τα ατομικιστικά-μικροσκοπικά μοντέλα στη μακροσκοπική συμπεριφορά.” 2011. Web. 05 Aug 2020.

Vancouver:

Ρέππας . Αδρομερής υπολογιστική ανάλυση της δυναμικής μεταδοτικών νόσων: από τα ατομικιστικά-μικροσκοπικά μοντέλα στη μακροσκοπική συμπεριφορά. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2011. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10442/hedi/27783.

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

Council of Science Editors:

Ρέππας . Αδρομερής υπολογιστική ανάλυση της δυναμικής μεταδοτικών νόσων: από τα ατομικιστικά-μικροσκοπικά μοντέλα στη μακροσκοπική συμπεριφορά. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2011. Available from: http://hdl.handle.net/10442/hedi/27783

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


Freie Universität Berlin

22. Djurdjevac, Nataša. Neue Methoden zur Analyse von komplexen Netzwerken mittels Zufallsspaziergängen.

Degree: 2012, Freie Universität Berlin

 Technische oder natürliche Systeme werden oft als Netzwerke modelliert. Viele der vorhandenen Methoden zur Analyse solcher komplexer Netzwerke wurden dazu entwickelt, sogenannte Module und Hubs… (more)

Subjects/Keywords: modular network; fuzzy clustering; committor; modules; Markov state models; hubs; Transition path theory; 500 Naturwissenschaften und Mathematik::510 Mathematik::519 Wahrscheinlichkeiten, angewandte Mathematik; 500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Djurdjevac, N. (2012). Neue Methoden zur Analyse von komplexen Netzwerken mittels Zufallsspaziergängen. (Thesis). Freie Universität Berlin. Retrieved from http://dx.doi.org/10.17169/refubium-10282

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):

Djurdjevac, Nataša. “Neue Methoden zur Analyse von komplexen Netzwerken mittels Zufallsspaziergängen.” 2012. Thesis, Freie Universität Berlin. Accessed August 05, 2020. http://dx.doi.org/10.17169/refubium-10282.

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

MLA Handbook (7th Edition):

Djurdjevac, Nataša. “Neue Methoden zur Analyse von komplexen Netzwerken mittels Zufallsspaziergängen.” 2012. Web. 05 Aug 2020.

Vancouver:

Djurdjevac N. Neue Methoden zur Analyse von komplexen Netzwerken mittels Zufallsspaziergängen. [Internet] [Thesis]. Freie Universität Berlin; 2012. [cited 2020 Aug 05]. Available from: http://dx.doi.org/10.17169/refubium-10282.

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

Council of Science Editors:

Djurdjevac N. Neue Methoden zur Analyse von komplexen Netzwerken mittels Zufallsspaziergängen. [Thesis]. Freie Universität Berlin; 2012. Available from: http://dx.doi.org/10.17169/refubium-10282

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

23. Teimoori, Maryam. Academic Curriculum (Study Path) Mining of Mechanical Engineering Undergraduate Students.

Degree: 2016, University of Illinois – Chicago

 Exploring the study paths of students in higher education is crucially important in order to maximize their likelihood of academic success. The study path of… (more)

Subjects/Keywords: Academic Curriculum Mining; Educational Data Mining Application; Study Path Analysis; Clustering; Classification

…discover the popular paths. A clustering task was applied to find the main, popular study path of… …in order to maximize their likelihood of academic success. The study path of a student is… …follows. First, it determines whether the current ME university approved study path is… …consistently followed by students. Using clustering methods, the study paths that are actually… …of students in each study path are measured. Furthermore, classification techniques are… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Teimoori, M. (2016). Academic Curriculum (Study Path) Mining of Mechanical Engineering Undergraduate Students. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20822

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):

Teimoori, Maryam. “Academic Curriculum (Study Path) Mining of Mechanical Engineering Undergraduate Students.” 2016. Thesis, University of Illinois – Chicago. Accessed August 05, 2020. http://hdl.handle.net/10027/20822.

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

MLA Handbook (7th Edition):

Teimoori, Maryam. “Academic Curriculum (Study Path) Mining of Mechanical Engineering Undergraduate Students.” 2016. Web. 05 Aug 2020.

Vancouver:

Teimoori M. Academic Curriculum (Study Path) Mining of Mechanical Engineering Undergraduate Students. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/10027/20822.

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

Council of Science Editors:

Teimoori M. Academic Curriculum (Study Path) Mining of Mechanical Engineering Undergraduate Students. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20822

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

24. Sun, Yizhou. Mining heterogeneous information networks.

Degree: PhD, 0112, 2013, University of Illinois – Urbana-Champaign

 Real-world physical objects and abstract data entities are interconnected, forming gigantic networks. By structuring these objects and their interactions into multiple types, such networks become… (more)

Subjects/Keywords: information network; social network; heterogeneous information network; data mining; network schema; meta-path; clustering; ranking; similarity search; relationship prediction; user-guided meta-path selection; relation strength-aware mining

…Chapter 7 User-Guided Clustering via Meta-Path Selection 7.1 Overview… …7.2 The Meta-Path Selection Problem for User-Guided Clustering 7.2.1 The Meta-Path Selection… …7.4.1 Optimize Clustering Result Given Meta-Path Weights 7.4.2 Optimize Meta-Path Weights… …clustering to general network schemas. In Part II: Meta-Path-Based Similarity Search and Mining, we… …network clustering. • Chapter 7: Integrating User-Guided Clustering with Meta-Path Selection… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, Y. (2013). Mining heterogeneous information networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42366

Chicago Manual of Style (16th Edition):

Sun, Yizhou. “Mining heterogeneous information networks.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed August 05, 2020. http://hdl.handle.net/2142/42366.

MLA Handbook (7th Edition):

Sun, Yizhou. “Mining heterogeneous information networks.” 2013. Web. 05 Aug 2020.

Vancouver:

Sun Y. Mining heterogeneous information networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Aug 05]. Available from: http://hdl.handle.net/2142/42366.

Council of Science Editors:

Sun Y. Mining heterogeneous information networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42366

25. Cameron, Delroy Huborn. A Context-Driven Subgraph Model for Literature-Based Discovery.

Degree: PhD, Computer Science and Engineering PhD, 2014, Wright State University

 Literature-Based Discovery (LBD) refers to the process of uncovering hidden connections that are implicit in scientific literature. Numerous hypotheses have been generated from scientific literature… (more)

Subjects/Keywords: Computer Science; Biomedical Research; Information Systems; Semantic Predications; Graph mining; Path clustering; Semantic relatedness; Literature-based discovery

path clustering and automatic subgraph generation. Chapter 5 presents the evaluation of the… …The approach is able to bridge disjoint and complementary literatures by clustering semantic… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cameron, D. H. (2014). A Context-Driven Subgraph Model for Literature-Based Discovery. (Doctoral Dissertation). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1417034001

Chicago Manual of Style (16th Edition):

Cameron, Delroy Huborn. “A Context-Driven Subgraph Model for Literature-Based Discovery.” 2014. Doctoral Dissertation, Wright State University. Accessed August 05, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=wright1417034001.

MLA Handbook (7th Edition):

Cameron, Delroy Huborn. “A Context-Driven Subgraph Model for Literature-Based Discovery.” 2014. Web. 05 Aug 2020.

Vancouver:

Cameron DH. A Context-Driven Subgraph Model for Literature-Based Discovery. [Internet] [Doctoral dissertation]. Wright State University; 2014. [cited 2020 Aug 05]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1417034001.

Council of Science Editors:

Cameron DH. A Context-Driven Subgraph Model for Literature-Based Discovery. [Doctoral Dissertation]. Wright State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1417034001

.