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:(Applied algorithms). Showing records 1 – 30 of 97 total matches.

[1] [2] [3] [4]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


University of California – Merced

1. Vaz, Garnet Jason. Graph Based Scalable Algorithms with Applications.

Degree: Applied Mathematics, 2014, University of California – Merced

 In this thesis, we propose various algorithms for problems arising in nonlinear circuits, nonlinear electromagnetics and data mining. Through the design and implementation of these… (more)

Subjects/Keywords: Applied mathematics; algorithms; graphs; scalability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vaz, G. J. (2014). Graph Based Scalable Algorithms with Applications. (Thesis). University of California – Merced. Retrieved from http://www.escholarship.org/uc/item/266130xp

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

Vaz, Garnet Jason. “Graph Based Scalable Algorithms with Applications.” 2014. Thesis, University of California – Merced. Accessed July 17, 2019. http://www.escholarship.org/uc/item/266130xp.

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

MLA Handbook (7th Edition):

Vaz, Garnet Jason. “Graph Based Scalable Algorithms with Applications.” 2014. Web. 17 Jul 2019.

Vancouver:

Vaz GJ. Graph Based Scalable Algorithms with Applications. [Internet] [Thesis]. University of California – Merced; 2014. [cited 2019 Jul 17]. Available from: http://www.escholarship.org/uc/item/266130xp.

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

Council of Science Editors:

Vaz GJ. Graph Based Scalable Algorithms with Applications. [Thesis]. University of California – Merced; 2014. Available from: http://www.escholarship.org/uc/item/266130xp

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


Stellenbosch University

2. Roux, Jeanne-Marie. Introduction to graphical models with an application in finding coplanar points.

Degree: Mathematical Sciences, 2010, Stellenbosch University

Thesis (MSc (Applied Mathematics)) – University of Stellenbosch, 2010.

ENGLISH ABSTRACT: This thesis provides an introduction to the statistical modeling technique known as graphical models. Since… (more)

Subjects/Keywords: Applied mathematics; Probability theory; Algorithms; Transformations (Mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roux, J. (2010). Introduction to graphical models with an application in finding coplanar points. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/4094

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

Roux, Jeanne-Marie. “Introduction to graphical models with an application in finding coplanar points.” 2010. Thesis, Stellenbosch University. Accessed July 17, 2019. http://hdl.handle.net/10019.1/4094.

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

MLA Handbook (7th Edition):

Roux, Jeanne-Marie. “Introduction to graphical models with an application in finding coplanar points.” 2010. Web. 17 Jul 2019.

Vancouver:

Roux J. Introduction to graphical models with an application in finding coplanar points. [Internet] [Thesis]. Stellenbosch University; 2010. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10019.1/4094.

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

Council of Science Editors:

Roux J. Introduction to graphical models with an application in finding coplanar points. [Thesis]. Stellenbosch University; 2010. Available from: http://hdl.handle.net/10019.1/4094

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

3. Abergel, Rémy. Quelques modèles mathématiques et algorithmes rapides pour le traitement d’images : Several mathematical models and fast algorithms for image processing.

Degree: Docteur es, Mathématiques appliquées, 2016, Sorbonne Paris Cité

 Dans cette thèse, nous nous intéressons à différents modèles mathématiques de traitement d’images numériques dits de bas niveau. Si l’approche mathématique permet d’établir des modèles… (more)

Subjects/Keywords: Mathématiques appliquées; Algorithmes; Applied mathematics; Algorithms; 519

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abergel, R. (2016). Quelques modèles mathématiques et algorithmes rapides pour le traitement d’images : Several mathematical models and fast algorithms for image processing. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2016USPCB051

Chicago Manual of Style (16th Edition):

Abergel, Rémy. “Quelques modèles mathématiques et algorithmes rapides pour le traitement d’images : Several mathematical models and fast algorithms for image processing.” 2016. Doctoral Dissertation, Sorbonne Paris Cité. Accessed July 17, 2019. http://www.theses.fr/2016USPCB051.

MLA Handbook (7th Edition):

Abergel, Rémy. “Quelques modèles mathématiques et algorithmes rapides pour le traitement d’images : Several mathematical models and fast algorithms for image processing.” 2016. Web. 17 Jul 2019.

Vancouver:

Abergel R. Quelques modèles mathématiques et algorithmes rapides pour le traitement d’images : Several mathematical models and fast algorithms for image processing. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2016. [cited 2019 Jul 17]. Available from: http://www.theses.fr/2016USPCB051.

Council of Science Editors:

Abergel R. Quelques modèles mathématiques et algorithmes rapides pour le traitement d’images : Several mathematical models and fast algorithms for image processing. [Doctoral Dissertation]. Sorbonne Paris Cité; 2016. Available from: http://www.theses.fr/2016USPCB051


University of Nevada – Las Vegas

4. Dasu, Nagendra Abhinav. Implementation of hidden semi-Markov models.

Degree: MSin Computer Science, Computer Science, 2011, University of Nevada – Las Vegas

  One of the most frequently used concepts applied to a variety of engineering and scientific studies over the recent years is that of a… (more)

Subjects/Keywords: Applied Mathematics; Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dasu, N. A. (2011). Implementation of hidden semi-Markov models. (Masters Thesis). University of Nevada – Las Vegas. Retrieved from https://digitalscholarship.unlv.edu/thesesdissertations/997

Chicago Manual of Style (16th Edition):

Dasu, Nagendra Abhinav. “Implementation of hidden semi-Markov models.” 2011. Masters Thesis, University of Nevada – Las Vegas. Accessed July 17, 2019. https://digitalscholarship.unlv.edu/thesesdissertations/997.

MLA Handbook (7th Edition):

Dasu, Nagendra Abhinav. “Implementation of hidden semi-Markov models.” 2011. Web. 17 Jul 2019.

Vancouver:

Dasu NA. Implementation of hidden semi-Markov models. [Internet] [Masters thesis]. University of Nevada – Las Vegas; 2011. [cited 2019 Jul 17]. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/997.

Council of Science Editors:

Dasu NA. Implementation of hidden semi-Markov models. [Masters Thesis]. University of Nevada – Las Vegas; 2011. Available from: https://digitalscholarship.unlv.edu/thesesdissertations/997


Northeastern University

5. Roche, Scott T. Robust local algorithms for communication and stability in distributed networks.

Degree: PhD, Computer Science Program, 2017, Northeastern University

 In a world in which our technological infrastructure is increasingly reliant on platforms that are distributed in nature, there is a substantial need for distributed… (more)

Subjects/Keywords: applied graph theory; distributed algorithms; epidemic processes; randomized algorithms; random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roche, S. T. (2017). Robust local algorithms for communication and stability in distributed networks. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20247295

Chicago Manual of Style (16th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Doctoral Dissertation, Northeastern University. Accessed July 17, 2019. http://hdl.handle.net/2047/D20247295.

MLA Handbook (7th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Web. 17 Jul 2019.

Vancouver:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Internet] [Doctoral dissertation]. Northeastern University; 2017. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/2047/D20247295.

Council of Science Editors:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Doctoral Dissertation]. Northeastern University; 2017. Available from: http://hdl.handle.net/2047/D20247295


Stellenbosch University

6. Profitt, Barton. Background subtraction algorithms for a video based system.

Degree: MScEng (Mathematical Sciences, Mathematical Sciences, 2009, Stellenbosch University

ENGLISH ABSTRACT: To reliably classify parts of an image sequence as foreground or background is an important part of many computer vision systems, such as… (more)

Subjects/Keywords: Applied mathematics; Dissertations  – Applied mathematics; Algorithms; Computer vision; Image processing; Mathematical Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Profitt, B. (2009). Background subtraction algorithms for a video based system. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/2303

Chicago Manual of Style (16th Edition):

Profitt, Barton. “Background subtraction algorithms for a video based system.” 2009. Masters Thesis, Stellenbosch University. Accessed July 17, 2019. http://hdl.handle.net/10019.1/2303.

MLA Handbook (7th Edition):

Profitt, Barton. “Background subtraction algorithms for a video based system.” 2009. Web. 17 Jul 2019.

Vancouver:

Profitt B. Background subtraction algorithms for a video based system. [Internet] [Masters thesis]. Stellenbosch University; 2009. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10019.1/2303.

Council of Science Editors:

Profitt B. Background subtraction algorithms for a video based system. [Masters Thesis]. Stellenbosch University; 2009. Available from: http://hdl.handle.net/10019.1/2303


University of Colorado

7. Lipinski, Douglas Martin. Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications.

Degree: PhD, Applied Mathematics, 2012, University of Colorado

  Lagrangian coherent structures (LCS) are recently defined structures used to analyze transport in dynamical systems with general time dependence. LCS techniques have seen increasing… (more)

Subjects/Keywords: dynamical systems; fast algorithms; Lagrangian coherent structures; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lipinski, D. M. (2012). Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications. (Doctoral Dissertation). University of Colorado. Retrieved from http://scholar.colorado.edu/appm_gradetds/56

Chicago Manual of Style (16th Edition):

Lipinski, Douglas Martin. “Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications.” 2012. Doctoral Dissertation, University of Colorado. Accessed July 17, 2019. http://scholar.colorado.edu/appm_gradetds/56.

MLA Handbook (7th Edition):

Lipinski, Douglas Martin. “Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications.” 2012. Web. 17 Jul 2019.

Vancouver:

Lipinski DM. Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2019 Jul 17]. Available from: http://scholar.colorado.edu/appm_gradetds/56.

Council of Science Editors:

Lipinski DM. Efficient Ridge Tracking Algorithms for Computing Lagrangian Coherent Structures in Fluid Dynamics Applications. [Doctoral Dissertation]. University of Colorado; 2012. Available from: http://scholar.colorado.edu/appm_gradetds/56


Purdue University

8. Long, Tengfei. AN ALGORITHM FOR IMPACTING SOFT STRUCTURES.

Degree: MS, Mechanical Engineering, 2014, Purdue University

  Impact among soft structures is often difficult to model because of the geometrical non-linearity involved. There are a number of previous studies of the… (more)

Subjects/Keywords: Applied sciences; Algorithms; Impacts; Soft structures; Mechanical Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Long, T. (2014). AN ALGORITHM FOR IMPACTING SOFT STRUCTURES. (Thesis). Purdue University. Retrieved from http://docs.lib.purdue.edu/open_access_theses/212

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

Long, Tengfei. “AN ALGORITHM FOR IMPACTING SOFT STRUCTURES.” 2014. Thesis, Purdue University. Accessed July 17, 2019. http://docs.lib.purdue.edu/open_access_theses/212.

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

MLA Handbook (7th Edition):

Long, Tengfei. “AN ALGORITHM FOR IMPACTING SOFT STRUCTURES.” 2014. Web. 17 Jul 2019.

Vancouver:

Long T. AN ALGORITHM FOR IMPACTING SOFT STRUCTURES. [Internet] [Thesis]. Purdue University; 2014. [cited 2019 Jul 17]. Available from: http://docs.lib.purdue.edu/open_access_theses/212.

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

Council of Science Editors:

Long T. AN ALGORITHM FOR IMPACTING SOFT STRUCTURES. [Thesis]. Purdue University; 2014. Available from: http://docs.lib.purdue.edu/open_access_theses/212

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


UCLA

9. Wang, Yuting. Virtual Node Algorithms for Simulating and Cutting Deformable Solids.

Degree: Mathematics, 2014, UCLA

 Physics based simulations often require solving differential equations on domains with irregular geometry. A popular approach to their numerical approximation is the finite element method… (more)

Subjects/Keywords: Applied mathematics; Computer science; cutting; deformable solids; simulation; virtual node algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (2014). Virtual Node Algorithms for Simulating and Cutting Deformable Solids. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/4753d717

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

Wang, Yuting. “Virtual Node Algorithms for Simulating and Cutting Deformable Solids.” 2014. Thesis, UCLA. Accessed July 17, 2019. http://www.escholarship.org/uc/item/4753d717.

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

MLA Handbook (7th Edition):

Wang, Yuting. “Virtual Node Algorithms for Simulating and Cutting Deformable Solids.” 2014. Web. 17 Jul 2019.

Vancouver:

Wang Y. Virtual Node Algorithms for Simulating and Cutting Deformable Solids. [Internet] [Thesis]. UCLA; 2014. [cited 2019 Jul 17]. Available from: http://www.escholarship.org/uc/item/4753d717.

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

Council of Science Editors:

Wang Y. Virtual Node Algorithms for Simulating and Cutting Deformable Solids. [Thesis]. UCLA; 2014. Available from: http://www.escholarship.org/uc/item/4753d717

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


University of California – Berkeley

10. Ballard, Grey. Avoiding Communication in Dense Linear Algebra.

Degree: Computer Science, 2013, University of California – Berkeley

 Dense linear algebra computations are essential to nearly every problem in scientific computing and to countless other fields. Most matrix computations enjoy a high computational… (more)

Subjects/Keywords: Computer science; Applied mathematics; algorithms; communication-avoiding; matrix computations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ballard, G. (2013). Avoiding Communication in Dense Linear Algebra. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/95n2b7vr

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

Ballard, Grey. “Avoiding Communication in Dense Linear Algebra.” 2013. Thesis, University of California – Berkeley. Accessed July 17, 2019. http://www.escholarship.org/uc/item/95n2b7vr.

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

MLA Handbook (7th Edition):

Ballard, Grey. “Avoiding Communication in Dense Linear Algebra.” 2013. Web. 17 Jul 2019.

Vancouver:

Ballard G. Avoiding Communication in Dense Linear Algebra. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Jul 17]. Available from: http://www.escholarship.org/uc/item/95n2b7vr.

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

Council of Science Editors:

Ballard G. Avoiding Communication in Dense Linear Algebra. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/95n2b7vr

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


Stellenbosch University

11. Winterbach, Wynand. The crossing number of a graph in the plane.

Degree: Mathematical Sciences, 2005, Stellenbosch University

Thesis (MSc (Mathematical Sciences. Applied Mathematics)) – University of Stellenbosch, 2005.

Heuristics for obtaining upper bounds on crossing numbers of small graphs in the plane, and… (more)

Subjects/Keywords: Applied mathematics; Graph algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Winterbach, W. (2005). The crossing number of a graph in the plane. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/2242

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

Winterbach, Wynand. “The crossing number of a graph in the plane.” 2005. Thesis, Stellenbosch University. Accessed July 17, 2019. http://hdl.handle.net/10019.1/2242.

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

MLA Handbook (7th Edition):

Winterbach, Wynand. “The crossing number of a graph in the plane.” 2005. Web. 17 Jul 2019.

Vancouver:

Winterbach W. The crossing number of a graph in the plane. [Internet] [Thesis]. Stellenbosch University; 2005. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10019.1/2242.

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

Council of Science Editors:

Winterbach W. The crossing number of a graph in the plane. [Thesis]. Stellenbosch University; 2005. Available from: http://hdl.handle.net/10019.1/2242

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


Indian Institute of Science

12. Narasimhadhan, A V. Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight.

Degree: 2012, Indian Institute of Science

 Filtered backprojection (FBP) reconstruction algorithms are very popular in the field of X-ray computed tomography (CT) because they give advantages in terms of the numerical… (more)

Subjects/Keywords: Image Processing; Computed Tomography; Fan-Beam Reconstruction Algorithms; Filtered Backprojection Reconstruction Algorithms; Feldkamp Davis and Kress (FDK) Reconstruction Algorithms; Hilbert and Hybrid Filtered Algorithms; Cone Beam Computed Tomography - Algorithms; Fan Beam Tomography - Algorithms; Cone-Beam Reconstruction Algorithms; FDK Algorithms; FBP Reconstruction Algorithms; Image Reconstruction; Fan-beam Algorithms; Hilbert Space; Applied Optics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Narasimhadhan, A. V. (2012). Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2342

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

Narasimhadhan, A V. “Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight.” 2012. Thesis, Indian Institute of Science. Accessed July 17, 2019. http://hdl.handle.net/2005/2342.

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

MLA Handbook (7th Edition):

Narasimhadhan, A V. “Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight.” 2012. Web. 17 Jul 2019.

Vancouver:

Narasimhadhan AV. Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/2005/2342.

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

Council of Science Editors:

Narasimhadhan AV. Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight. [Thesis]. Indian Institute of Science; 2012. Available from: http://hdl.handle.net/2005/2342

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


Indian Institute of Science

13. Narasimhadhan, A V. Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight.

Degree: 2012, Indian Institute of Science

 Filtered backprojection (FBP) reconstruction algorithms are very popular in the field of X-ray computed tomography (CT) because they give advantages in terms of the numerical… (more)

Subjects/Keywords: Image Processing; Computed Tomography; Fan-Beam Reconstruction Algorithms; Filtered Backprojection Reconstruction Algorithms; Feldkamp Davis and Kress (FDK) Reconstruction Algorithms; Hilbert and Hybrid Filtered Algorithms; Cone Beam Computed Tomography - Algorithms; Fan Beam Tomography - Algorithms; Cone-Beam Reconstruction Algorithms; FDK Algorithms; FBP Reconstruction Algorithms; Image Reconstruction; Fan-beam Algorithms; Hilbert Space; Applied Optics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Narasimhadhan, A. V. (2012). Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2342 ; http://etd.ncsi.iisc.ernet.in/abstracts/3013/G25331-Abs.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):

Narasimhadhan, A V. “Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight.” 2012. Thesis, Indian Institute of Science. Accessed July 17, 2019. http://etd.iisc.ernet.in/handle/2005/2342 ; http://etd.ncsi.iisc.ernet.in/abstracts/3013/G25331-Abs.pdf.

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

MLA Handbook (7th Edition):

Narasimhadhan, A V. “Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight.” 2012. Web. 17 Jul 2019.

Vancouver:

Narasimhadhan AV. Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight. [Internet] [Thesis]. Indian Institute of Science; 2012. [cited 2019 Jul 17]. Available from: http://etd.iisc.ernet.in/handle/2005/2342 ; http://etd.ncsi.iisc.ernet.in/abstracts/3013/G25331-Abs.pdf.

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

Council of Science Editors:

Narasimhadhan AV. Image Reconstruction Based On Hilbert And Hybrid Filtered Algorithms With Inverse Distance Weight And No Backprojection Weight. [Thesis]. Indian Institute of Science; 2012. Available from: http://etd.iisc.ernet.in/handle/2005/2342 ; http://etd.ncsi.iisc.ernet.in/abstracts/3013/G25331-Abs.pdf

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


Indian Institute of Science

14. Gupta, Pradeep Kumar. Denoising And Inpainting Of Images : A Transform Domain Based Approach.

Degree: 2007, Indian Institute of Science

 Many scientific data sets are contaminated by noise, either because of data acquisition process, or because of naturally occurring phenomena. A first step in analyzing… (more)

Subjects/Keywords: Image Processing; Denoising; Inpainting; Image Denoising Algorithms; Inpainting Algorithms; Discrete Cosine Transform (DCT); Wavelet Transform; Applied Optics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, P. K. (2007). Denoising And Inpainting Of Images : A Transform Domain Based Approach. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/515

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

Gupta, Pradeep Kumar. “Denoising And Inpainting Of Images : A Transform Domain Based Approach.” 2007. Thesis, Indian Institute of Science. Accessed July 17, 2019. http://hdl.handle.net/2005/515.

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

MLA Handbook (7th Edition):

Gupta, Pradeep Kumar. “Denoising And Inpainting Of Images : A Transform Domain Based Approach.” 2007. Web. 17 Jul 2019.

Vancouver:

Gupta PK. Denoising And Inpainting Of Images : A Transform Domain Based Approach. [Internet] [Thesis]. Indian Institute of Science; 2007. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/2005/515.

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

Council of Science Editors:

Gupta PK. Denoising And Inpainting Of Images : A Transform Domain Based Approach. [Thesis]. Indian Institute of Science; 2007. Available from: http://hdl.handle.net/2005/515

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


University of Colorado

15. Appelhans, David John. Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement.

Degree: PhD, Applied Mathematics, 2014, University of Colorado

  In this thesis we propose a new algorithm for solving PDEs on massively parallel computers. The Nested Iteration Adaptive Mesh Refinement Range Decomposition (NI-AMRRD)… (more)

Subjects/Keywords: Adaptive Refinement; FOSLS; High Performance Computing; Nested Iteration; Parallel Algorithms; Range Decomposition; Applied Mathematics; Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Appelhans, D. J. (2014). Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement. (Doctoral Dissertation). University of Colorado. Retrieved from http://scholar.colorado.edu/appm_gradetds/63

Chicago Manual of Style (16th Edition):

Appelhans, David John. “Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement.” 2014. Doctoral Dissertation, University of Colorado. Accessed July 17, 2019. http://scholar.colorado.edu/appm_gradetds/63.

MLA Handbook (7th Edition):

Appelhans, David John. “Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement.” 2014. Web. 17 Jul 2019.

Vancouver:

Appelhans DJ. Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement. [Internet] [Doctoral dissertation]. University of Colorado; 2014. [cited 2019 Jul 17]. Available from: http://scholar.colorado.edu/appm_gradetds/63.

Council of Science Editors:

Appelhans DJ. Trading Computation for Communication: A Low Communication Algorithm for the Parallel Solution of PDEs Using Range Decomposition, Nested Iteration, and Adaptive Mesh Refinement. [Doctoral Dissertation]. University of Colorado; 2014. Available from: http://scholar.colorado.edu/appm_gradetds/63


University of Colorado

16. O'Neill, Ben. Multigrid Reduction in Time for Nonlinear Parabolic Problems.

Degree: PhD, Applied Mathematics, 2017, University of Colorado

  The need for parallelism in the time dimension is being driven by changes in computer architectures, where recent performance increases are attributed to greater… (more)

Subjects/Keywords: high performance computing; multigrid; parallel in time; Applied Mathematics; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

O'Neill, B. (2017). Multigrid Reduction in Time for Nonlinear Parabolic Problems. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/92

Chicago Manual of Style (16th Edition):

O'Neill, Ben. “Multigrid Reduction in Time for Nonlinear Parabolic Problems.” 2017. Doctoral Dissertation, University of Colorado. Accessed July 17, 2019. https://scholar.colorado.edu/appm_gradetds/92.

MLA Handbook (7th Edition):

O'Neill, Ben. “Multigrid Reduction in Time for Nonlinear Parabolic Problems.” 2017. Web. 17 Jul 2019.

Vancouver:

O'Neill B. Multigrid Reduction in Time for Nonlinear Parabolic Problems. [Internet] [Doctoral dissertation]. University of Colorado; 2017. [cited 2019 Jul 17]. Available from: https://scholar.colorado.edu/appm_gradetds/92.

Council of Science Editors:

O'Neill B. Multigrid Reduction in Time for Nonlinear Parabolic Problems. [Doctoral Dissertation]. University of Colorado; 2017. Available from: https://scholar.colorado.edu/appm_gradetds/92


University of California – San Diego

17. Mateos-Núñez, David. Distributed Algorithms for Convex Optimization: noisy channels, online computation, nuclear norm regularization, and separable constraints.

Degree: Engineering Sciences (Applied Mechanics), 2015, University of California – San Diego

 This thesis contributes to the body of research in the design and analysis of distributed algorithms for the optimization of a sum of convex functions,… (more)

Subjects/Keywords: Applied mathematics; Robotics; Mechanical engineering; Consensus; Convex optimization; Distributed algorithms; Machine learning; Multi-agent systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mateos-Núñez, D. (2015). Distributed Algorithms for Convex Optimization: noisy channels, online computation, nuclear norm regularization, and separable constraints. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/1xf0d3dr

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

Mateos-Núñez, David. “Distributed Algorithms for Convex Optimization: noisy channels, online computation, nuclear norm regularization, and separable constraints.” 2015. Thesis, University of California – San Diego. Accessed July 17, 2019. http://www.escholarship.org/uc/item/1xf0d3dr.

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

MLA Handbook (7th Edition):

Mateos-Núñez, David. “Distributed Algorithms for Convex Optimization: noisy channels, online computation, nuclear norm regularization, and separable constraints.” 2015. Web. 17 Jul 2019.

Vancouver:

Mateos-Núñez D. Distributed Algorithms for Convex Optimization: noisy channels, online computation, nuclear norm regularization, and separable constraints. [Internet] [Thesis]. University of California – San Diego; 2015. [cited 2019 Jul 17]. Available from: http://www.escholarship.org/uc/item/1xf0d3dr.

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

Council of Science Editors:

Mateos-Núñez D. Distributed Algorithms for Convex Optimization: noisy channels, online computation, nuclear norm regularization, and separable constraints. [Thesis]. University of California – San Diego; 2015. Available from: http://www.escholarship.org/uc/item/1xf0d3dr

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


University of California – Riverside

18. Williams, Parker. Information Gathering on Bounded Degree Trees and Properties of Random Matrices.

Degree: Mathematics, 2017, University of California – Riverside

 In this thesis two questions are addressed. First is the question of the time complexity of an algorithm gathering information on a tree with unknown… (more)

Subjects/Keywords: Mathematics; Applied mathematics; Data Structures; Graph Algorithms; Graph Spectrum; Integral Eigenvalue; Random Matrix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Williams, P. (2017). Information Gathering on Bounded Degree Trees and Properties of Random Matrices. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/40s7r2b1

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

Williams, Parker. “Information Gathering on Bounded Degree Trees and Properties of Random Matrices.” 2017. Thesis, University of California – Riverside. Accessed July 17, 2019. http://www.escholarship.org/uc/item/40s7r2b1.

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

MLA Handbook (7th Edition):

Williams, Parker. “Information Gathering on Bounded Degree Trees and Properties of Random Matrices.” 2017. Web. 17 Jul 2019.

Vancouver:

Williams P. Information Gathering on Bounded Degree Trees and Properties of Random Matrices. [Internet] [Thesis]. University of California – Riverside; 2017. [cited 2019 Jul 17]. Available from: http://www.escholarship.org/uc/item/40s7r2b1.

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

Council of Science Editors:

Williams P. Information Gathering on Bounded Degree Trees and Properties of Random Matrices. [Thesis]. University of California – Riverside; 2017. Available from: http://www.escholarship.org/uc/item/40s7r2b1

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


University of California – Berkeley

19. Orecchia, Lorenzo. Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques.

Degree: Electrical Engineering & Computer Sciences, 2011, University of California – Berkeley

 Graph partitioning problems are a central topic of research in the study of approximation algorithms. They are of interest to theoretical computer scientists for their… (more)

Subjects/Keywords: Computer science; Applied mathematics; Approximation algorithms; Combinatorial optimization; Graph partitioning; Spectral methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Orecchia, L. (2011). Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/2z90d0qn

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

Orecchia, Lorenzo. “Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques.” 2011. Thesis, University of California – Berkeley. Accessed July 17, 2019. http://www.escholarship.org/uc/item/2z90d0qn.

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

MLA Handbook (7th Edition):

Orecchia, Lorenzo. “Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques.” 2011. Web. 17 Jul 2019.

Vancouver:

Orecchia L. Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2019 Jul 17]. Available from: http://www.escholarship.org/uc/item/2z90d0qn.

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

Council of Science Editors:

Orecchia L. Fast Approximation Algorithms for Graph Partitioning Using Spectral and Semidefinite-Programming Techniques. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/2z90d0qn

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


University of Victoria

20. Deugau, Christopher Jordan. Algorithms and combinatorics of maximal compact codes.

Degree: Dept. of Computer Science, 2010, University of Victoria

 The implementation of two different algorithms for generating compact codes of some size N are presented. An analysis of both algorithms is given. in an… (more)

Subjects/Keywords: combinatorial analysis; algorithms; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deugau, C. J. (2010). Algorithms and combinatorics of maximal compact codes. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2101

Chicago Manual of Style (16th Edition):

Deugau, Christopher Jordan. “Algorithms and combinatorics of maximal compact codes.” 2010. Masters Thesis, University of Victoria. Accessed July 17, 2019. http://hdl.handle.net/1828/2101.

MLA Handbook (7th Edition):

Deugau, Christopher Jordan. “Algorithms and combinatorics of maximal compact codes.” 2010. Web. 17 Jul 2019.

Vancouver:

Deugau CJ. Algorithms and combinatorics of maximal compact codes. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1828/2101.

Council of Science Editors:

Deugau CJ. Algorithms and combinatorics of maximal compact codes. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2101


University of Victoria

21. Shoaran, Maryam. Distributed multi-source regular path queries.

Degree: Dept. of Computer Science, 2010, University of Victoria

 Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data… (more)

Subjects/Keywords: Regular path queries; Algorithms; Databases; UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shoaran, M. (2010). Distributed multi-source regular path queries. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/2471

Chicago Manual of Style (16th Edition):

Shoaran, Maryam. “Distributed multi-source regular path queries.” 2010. Masters Thesis, University of Victoria. Accessed July 17, 2019. http://hdl.handle.net/1828/2471.

MLA Handbook (7th Edition):

Shoaran, Maryam. “Distributed multi-source regular path queries.” 2010. Web. 17 Jul 2019.

Vancouver:

Shoaran M. Distributed multi-source regular path queries. [Internet] [Masters thesis]. University of Victoria; 2010. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1828/2471.

Council of Science Editors:

Shoaran M. Distributed multi-source regular path queries. [Masters Thesis]. University of Victoria; 2010. Available from: http://hdl.handle.net/1828/2471


University of Arkansas

22. Jadhav, Supriya Arun. On Export Intermodal Transportation Problem.

Degree: MS, 2012, University of Arkansas

  This thesis investigates a logistics problem facing companies that export their products to other countries. The problem is called export intermodal transportation problem. In… (more)

Subjects/Keywords: Social sciences; Applied sciences; Algorithms; Transportation; Operations and Supply Chain Management; Technology and Innovation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jadhav, S. A. (2012). On Export Intermodal Transportation Problem. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/620

Chicago Manual of Style (16th Edition):

Jadhav, Supriya Arun. “On Export Intermodal Transportation Problem.” 2012. Masters Thesis, University of Arkansas. Accessed July 17, 2019. https://scholarworks.uark.edu/etd/620.

MLA Handbook (7th Edition):

Jadhav, Supriya Arun. “On Export Intermodal Transportation Problem.” 2012. Web. 17 Jul 2019.

Vancouver:

Jadhav SA. On Export Intermodal Transportation Problem. [Internet] [Masters thesis]. University of Arkansas; 2012. [cited 2019 Jul 17]. Available from: https://scholarworks.uark.edu/etd/620.

Council of Science Editors:

Jadhav SA. On Export Intermodal Transportation Problem. [Masters Thesis]. University of Arkansas; 2012. Available from: https://scholarworks.uark.edu/etd/620


Iowa State University

23. Chuang, Pi-Chun. Description and error analysis of a rapidly converging norm reduction method for eigenvectors.

Degree: 1970, Iowa State University

Subjects/Keywords: Matrices; Eigenvectors; Algorithms; Applied Mathematics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chuang, P. (1970). Description and error analysis of a rapidly converging norm reduction method for eigenvectors. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/rtd/4825

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

Chuang, Pi-Chun. “Description and error analysis of a rapidly converging norm reduction method for eigenvectors.” 1970. Thesis, Iowa State University. Accessed July 17, 2019. https://lib.dr.iastate.edu/rtd/4825.

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

MLA Handbook (7th Edition):

Chuang, Pi-Chun. “Description and error analysis of a rapidly converging norm reduction method for eigenvectors.” 1970. Web. 17 Jul 2019.

Vancouver:

Chuang P. Description and error analysis of a rapidly converging norm reduction method for eigenvectors. [Internet] [Thesis]. Iowa State University; 1970. [cited 2019 Jul 17]. Available from: https://lib.dr.iastate.edu/rtd/4825.

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

Council of Science Editors:

Chuang P. Description and error analysis of a rapidly converging norm reduction method for eigenvectors. [Thesis]. Iowa State University; 1970. Available from: https://lib.dr.iastate.edu/rtd/4825

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


Virginia Commonwealth University

24. Srinivasan, Sudharshana. Spatial Scheduling Algorithms for Production Planning Problems.

Degree: PhD, Systems Modeling and Analysis, 2014, Virginia Commonwealth University

 Spatial resource allocation is an important consideration in shipbuilding and large-scale manufacturing industries. Spatial scheduling problems (SSP) involve the non-overlapping arrangement of jobs within a… (more)

Subjects/Keywords: Discrete Optimization; Production Scheduling; Approximation Algorithms; Applied Mathematics; Physical Sciences and Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Srinivasan, S. (2014). Spatial Scheduling Algorithms for Production Planning Problems. (Doctoral Dissertation). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/3406

Chicago Manual of Style (16th Edition):

Srinivasan, Sudharshana. “Spatial Scheduling Algorithms for Production Planning Problems.” 2014. Doctoral Dissertation, Virginia Commonwealth University. Accessed July 17, 2019. https://scholarscompass.vcu.edu/etd/3406.

MLA Handbook (7th Edition):

Srinivasan, Sudharshana. “Spatial Scheduling Algorithms for Production Planning Problems.” 2014. Web. 17 Jul 2019.

Vancouver:

Srinivasan S. Spatial Scheduling Algorithms for Production Planning Problems. [Internet] [Doctoral dissertation]. Virginia Commonwealth University; 2014. [cited 2019 Jul 17]. Available from: https://scholarscompass.vcu.edu/etd/3406.

Council of Science Editors:

Srinivasan S. Spatial Scheduling Algorithms for Production Planning Problems. [Doctoral Dissertation]. Virginia Commonwealth University; 2014. Available from: https://scholarscompass.vcu.edu/etd/3406


Cornell University

25. Freund, Daniel. Models and Algorithms for Transportation in the Sharing Economy .

Degree: 2018, Cornell University

 This thesis consist of two parts. The first deals with bike-sharing systems which are now ubiquitous across the U.S.A. We have worked with Motivate, the… (more)

Subjects/Keywords: Applied mathematics; Algorithms; Optimization; Computer science; Transportation; Operations research; Stochastic modeling; Data Science; Sharing Economy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Freund, D. (2018). Models and Algorithms for Transportation in the Sharing Economy . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/59625

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

Freund, Daniel. “Models and Algorithms for Transportation in the Sharing Economy .” 2018. Thesis, Cornell University. Accessed July 17, 2019. http://hdl.handle.net/1813/59625.

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

MLA Handbook (7th Edition):

Freund, Daniel. “Models and Algorithms for Transportation in the Sharing Economy .” 2018. Web. 17 Jul 2019.

Vancouver:

Freund D. Models and Algorithms for Transportation in the Sharing Economy . [Internet] [Thesis]. Cornell University; 2018. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1813/59625.

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

Council of Science Editors:

Freund D. Models and Algorithms for Transportation in the Sharing Economy . [Thesis]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/59625

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


University of Pennsylvania

26. Zargham, Michael. Fast, Distributed Optimization Strategies for Resource Allocation in Networks.

Degree: 2014, University of Pennsylvania

 Many challenges in network science and engineering today arise from systems composed of many individual agents interacting over a network. Such problems range from humans… (more)

Subjects/Keywords: Control Theory; Distributed Algorithms; Network Science; Optimization; Applied Mathematics; Computer Sciences; Electrical and Electronics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zargham, M. (2014). Fast, Distributed Optimization Strategies for Resource Allocation in Networks. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/1515

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

Zargham, Michael. “Fast, Distributed Optimization Strategies for Resource Allocation in Networks.” 2014. Thesis, University of Pennsylvania. Accessed July 17, 2019. https://repository.upenn.edu/edissertations/1515.

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

MLA Handbook (7th Edition):

Zargham, Michael. “Fast, Distributed Optimization Strategies for Resource Allocation in Networks.” 2014. Web. 17 Jul 2019.

Vancouver:

Zargham M. Fast, Distributed Optimization Strategies for Resource Allocation in Networks. [Internet] [Thesis]. University of Pennsylvania; 2014. [cited 2019 Jul 17]. Available from: https://repository.upenn.edu/edissertations/1515.

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

Council of Science Editors:

Zargham M. Fast, Distributed Optimization Strategies for Resource Allocation in Networks. [Thesis]. University of Pennsylvania; 2014. Available from: https://repository.upenn.edu/edissertations/1515

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


University of Colorado

27. Pieper, Jaden K. Unentangling Quantum Algorithms for Mathematicians and Engineers.

Degree: MS, 2017, University of Colorado

  As industry continues to inspire considerable growth in the research and development of quantum computers, it is increasingly worthwhile to familiarize oneself with the… (more)

Subjects/Keywords: quantum algorithms; quantum computing; mathematics; tool; development; Applied Mathematics; Numerical Analysis and Scientific Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pieper, J. K. (2017). Unentangling Quantum Algorithms for Mathematicians and Engineers. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/129

Chicago Manual of Style (16th Edition):

Pieper, Jaden K. “Unentangling Quantum Algorithms for Mathematicians and Engineers.” 2017. Masters Thesis, University of Colorado. Accessed July 17, 2019. https://scholar.colorado.edu/appm_gradetds/129.

MLA Handbook (7th Edition):

Pieper, Jaden K. “Unentangling Quantum Algorithms for Mathematicians and Engineers.” 2017. Web. 17 Jul 2019.

Vancouver:

Pieper JK. Unentangling Quantum Algorithms for Mathematicians and Engineers. [Internet] [Masters thesis]. University of Colorado; 2017. [cited 2019 Jul 17]. Available from: https://scholar.colorado.edu/appm_gradetds/129.

Council of Science Editors:

Pieper JK. Unentangling Quantum Algorithms for Mathematicians and Engineers. [Masters Thesis]. University of Colorado; 2017. Available from: https://scholar.colorado.edu/appm_gradetds/129


Cornell University

28. Gurram, Adithya Sagar. DEVELOPMENT AND APPLICATION OF A REDUCED ORDER MATHEMATICAL FRAMEWORK TO UNRAVEL THE COMPLEXITY OF TRAUMA INDUCED COAGULOPATHY .

Degree: 2017, Cornell University

 Trauma is the leading cause of death and disability in United States for both children and adults. In response to trauma, the body unleashes a… (more)

Subjects/Keywords: Complement; Evolutionary Algorithms; Model Compression; Non-linear Optimization; Trauma; Computer engineering; Applied mathematics; Bioinformatics; Coagulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gurram, A. S. (2017). DEVELOPMENT AND APPLICATION OF A REDUCED ORDER MATHEMATICAL FRAMEWORK TO UNRAVEL THE COMPLEXITY OF TRAUMA INDUCED COAGULOPATHY . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/51664

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

Gurram, Adithya Sagar. “DEVELOPMENT AND APPLICATION OF A REDUCED ORDER MATHEMATICAL FRAMEWORK TO UNRAVEL THE COMPLEXITY OF TRAUMA INDUCED COAGULOPATHY .” 2017. Thesis, Cornell University. Accessed July 17, 2019. http://hdl.handle.net/1813/51664.

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

MLA Handbook (7th Edition):

Gurram, Adithya Sagar. “DEVELOPMENT AND APPLICATION OF A REDUCED ORDER MATHEMATICAL FRAMEWORK TO UNRAVEL THE COMPLEXITY OF TRAUMA INDUCED COAGULOPATHY .” 2017. Web. 17 Jul 2019.

Vancouver:

Gurram AS. DEVELOPMENT AND APPLICATION OF A REDUCED ORDER MATHEMATICAL FRAMEWORK TO UNRAVEL THE COMPLEXITY OF TRAUMA INDUCED COAGULOPATHY . [Internet] [Thesis]. Cornell University; 2017. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/1813/51664.

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

Council of Science Editors:

Gurram AS. DEVELOPMENT AND APPLICATION OF A REDUCED ORDER MATHEMATICAL FRAMEWORK TO UNRAVEL THE COMPLEXITY OF TRAUMA INDUCED COAGULOPATHY . [Thesis]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/51664

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


Nanyang Technological University

29. Huzhang, Guangda. Efficiency, fairness and incentives in resource allocation .

Degree: 2018, Nanyang Technological University

 Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair manner. Due to its wide applications in real-life, finding such… (more)

Subjects/Keywords: DRNTU::Science::Mathematics::Discrete mathematics::Algorithms; DRNTU::Science::Mathematics::Applied mathematics::Game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huzhang, G. (2018). Efficiency, fairness and incentives in resource allocation . (Thesis). Nanyang Technological University. Retrieved from http://hdl.handle.net/10220/46645

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

Huzhang, Guangda. “Efficiency, fairness and incentives in resource allocation .” 2018. Thesis, Nanyang Technological University. Accessed July 17, 2019. http://hdl.handle.net/10220/46645.

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

MLA Handbook (7th Edition):

Huzhang, Guangda. “Efficiency, fairness and incentives in resource allocation .” 2018. Web. 17 Jul 2019.

Vancouver:

Huzhang G. Efficiency, fairness and incentives in resource allocation . [Internet] [Thesis]. Nanyang Technological University; 2018. [cited 2019 Jul 17]. Available from: http://hdl.handle.net/10220/46645.

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

Council of Science Editors:

Huzhang G. Efficiency, fairness and incentives in resource allocation . [Thesis]. Nanyang Technological University; 2018. Available from: http://hdl.handle.net/10220/46645

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


Montana Tech

30. Khormali, Omid. High Dimensional Outlier Detection.

Degree: MS, 2019, Montana Tech

  In statistics and data science, outliers are data points that differ greatly from other observations in a data set. They are important attributes of… (more)

Subjects/Keywords: Outlier; Computational complexity; High dimesional dataset; Applied Statistics; Probability; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khormali, O. (2019). High Dimensional Outlier Detection. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/11377

Chicago Manual of Style (16th Edition):

Khormali, Omid. “High Dimensional Outlier Detection.” 2019. Masters Thesis, Montana Tech. Accessed July 17, 2019. https://scholarworks.umt.edu/etd/11377.

MLA Handbook (7th Edition):

Khormali, Omid. “High Dimensional Outlier Detection.” 2019. Web. 17 Jul 2019.

Vancouver:

Khormali O. High Dimensional Outlier Detection. [Internet] [Masters thesis]. Montana Tech; 2019. [cited 2019 Jul 17]. Available from: https://scholarworks.umt.edu/etd/11377.

Council of Science Editors:

Khormali O. High Dimensional Outlier Detection. [Masters Thesis]. Montana Tech; 2019. Available from: https://scholarworks.umt.edu/etd/11377

[1] [2] [3] [4]

.