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:( Binary Tree Partitions). Showing records 1 – 30 of 5616 total matches.

[1] [2] [3] [4] [5] … [188]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Clemson University

1. Ganguly, Soumendra. <i>m</i>-ARY Partitions.

Degree: MS, Mathematical Sciences, 2019, Clemson University

  We study the number of ways in which <i>n</i> ≥ 0 be written as the sum of powers of <i>m</i> ≥ 2. After briefly… (more)

Subjects/Keywords: asymptotics; binary partitions; functional equation; mahler's partition problem; m-ary partitions; partitions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ganguly, S. (2019). <i>m</i>-ARY Partitions. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/3165

Chicago Manual of Style (16th Edition):

Ganguly, Soumendra. “<i>m</i>-ARY Partitions.” 2019. Masters Thesis, Clemson University. Accessed July 11, 2020. https://tigerprints.clemson.edu/all_theses/3165.

MLA Handbook (7th Edition):

Ganguly, Soumendra. “<i>m</i>-ARY Partitions.” 2019. Web. 11 Jul 2020.

Vancouver:

Ganguly S. <i>m</i>-ARY Partitions. [Internet] [Masters thesis]. Clemson University; 2019. [cited 2020 Jul 11]. Available from: https://tigerprints.clemson.edu/all_theses/3165.

Council of Science Editors:

Ganguly S. <i>m</i>-ARY Partitions. [Masters Thesis]. Clemson University; 2019. Available from: https://tigerprints.clemson.edu/all_theses/3165

2. Randrianasoa, Tianatahina Jimmy Francky. Représentation d'images hiérarchique multi-critère : Hierarchical multi-feature image representation.

Degree: Docteur es, Sciences - STS, 2017, Reims

La segmentation est une tâche cruciale en analyse d’images. L’évolution des capteurs d’acquisition induit de nouvelles images de résolution élevée, contenant des objets hétérogènes. Il… (more)

Subjects/Keywords: Arbre binaire de partitions; Hiérarchie morphologique; Segmentation d'image; Multicritère; Traitement d’image par graphe; Orphologique. segmentation d’image. multicritère. traitement d’image par graphe. évaluation de la qualité supervisée; Binary partition tree; Hierarchical morphology; Image segmentation; Multi-Feature; Graph-Based image processing; Supervised quality evaluation; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Randrianasoa, T. J. F. (2017). Représentation d'images hiérarchique multi-critère : Hierarchical multi-feature image representation. (Doctoral Dissertation). Reims. Retrieved from http://www.theses.fr/2017REIMS040

Chicago Manual of Style (16th Edition):

Randrianasoa, Tianatahina Jimmy Francky. “Représentation d'images hiérarchique multi-critère : Hierarchical multi-feature image representation.” 2017. Doctoral Dissertation, Reims. Accessed July 11, 2020. http://www.theses.fr/2017REIMS040.

MLA Handbook (7th Edition):

Randrianasoa, Tianatahina Jimmy Francky. “Représentation d'images hiérarchique multi-critère : Hierarchical multi-feature image representation.” 2017. Web. 11 Jul 2020.

Vancouver:

Randrianasoa TJF. Représentation d'images hiérarchique multi-critère : Hierarchical multi-feature image representation. [Internet] [Doctoral dissertation]. Reims; 2017. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2017REIMS040.

Council of Science Editors:

Randrianasoa TJF. Représentation d'images hiérarchique multi-critère : Hierarchical multi-feature image representation. [Doctoral Dissertation]. Reims; 2017. Available from: http://www.theses.fr/2017REIMS040


Oregon State University

3. Al-Saedi, Ali Hammood. Periodicity and Partition Congruences.

Degree: PhD, 2017, Oregon State University

 In this note, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a… (more)

Subjects/Keywords: Partitions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Saedi, A. H. (2017). Periodicity and Partition Congruences. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/61674

Chicago Manual of Style (16th Edition):

Al-Saedi, Ali Hammood. “Periodicity and Partition Congruences.” 2017. Doctoral Dissertation, Oregon State University. Accessed July 11, 2020. http://hdl.handle.net/1957/61674.

MLA Handbook (7th Edition):

Al-Saedi, Ali Hammood. “Periodicity and Partition Congruences.” 2017. Web. 11 Jul 2020.

Vancouver:

Al-Saedi AH. Periodicity and Partition Congruences. [Internet] [Doctoral dissertation]. Oregon State University; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1957/61674.

Council of Science Editors:

Al-Saedi AH. Periodicity and Partition Congruences. [Doctoral Dissertation]. Oregon State University; 2017. Available from: http://hdl.handle.net/1957/61674

4. Curado, Manuel. Structural Similarity: Applications to Object Recognition and Clustering .

Degree: 2018, University of Alicante

 In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and graph (global) similarity. Concerning node… (more)

Subjects/Keywords: Graph densification; Cut similarity; Spectral clustering; Dirichlet problems; Random walkers; Commute Times; Graph algorithms; Regular Partition; Szemeredi; Alzheimer's disease; Graphs; Return Random Walk; Net4lap; Directed graphs; Spectral graph theory; Graph entropy; Mutual information; Manifold alignment; m-Best Graph Matching; Binary-Tree Partitions; QAP; Graph sparsification; Shape simplification; Alpha shapes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Curado, M. (2018). Structural Similarity: Applications to Object Recognition and Clustering . (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/98110

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

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Thesis, University of Alicante. Accessed July 11, 2020. http://hdl.handle.net/10045/98110.

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

MLA Handbook (7th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 11 Jul 2020.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10045/98110.

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

Council of Science Editors:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/98110

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

5. Reeves, Tonya. Repetition-free edge-colorings of k-ary trees .

Degree: 2014, California State University – San Marcos

 A repetition is a sequence of symbols in which the first half is the same as the second half. An edge-coloring of a graph is… (more)

Subjects/Keywords: binary tree; k-ary tree; repetition-free; edge-coloring

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reeves, T. (2014). Repetition-free edge-colorings of k-ary trees . (Thesis). California State University – San Marcos. Retrieved from http://hdl.handle.net/10211.3/131312

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

Reeves, Tonya. “Repetition-free edge-colorings of k-ary trees .” 2014. Thesis, California State University – San Marcos. Accessed July 11, 2020. http://hdl.handle.net/10211.3/131312.

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

MLA Handbook (7th Edition):

Reeves, Tonya. “Repetition-free edge-colorings of k-ary trees .” 2014. Web. 11 Jul 2020.

Vancouver:

Reeves T. Repetition-free edge-colorings of k-ary trees . [Internet] [Thesis]. California State University – San Marcos; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10211.3/131312.

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

Council of Science Editors:

Reeves T. Repetition-free edge-colorings of k-ary trees . [Thesis]. California State University – San Marcos; 2014. Available from: http://hdl.handle.net/10211.3/131312

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


California State University – Sacramento

6. Shah, Parth. Net camera interface using Rabbit Microprocessor development board RCM3365.

Degree: MS, Electrical and Electronic Engineering, 2011, California State University – Sacramento

 In this high technology world, as we know in day to day life the importance of different application using internet is becoming widespread. Rapid growth… (more)

Subjects/Keywords: Rabbit Microprocessor; Camera interface; Binary search; B + tree; B * - tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shah, P. (2011). Net camera interface using Rabbit Microprocessor development board RCM3365. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.9/1276

Chicago Manual of Style (16th Edition):

Shah, Parth. “Net camera interface using Rabbit Microprocessor development board RCM3365.” 2011. Masters Thesis, California State University – Sacramento. Accessed July 11, 2020. http://hdl.handle.net/10211.9/1276.

MLA Handbook (7th Edition):

Shah, Parth. “Net camera interface using Rabbit Microprocessor development board RCM3365.” 2011. Web. 11 Jul 2020.

Vancouver:

Shah P. Net camera interface using Rabbit Microprocessor development board RCM3365. [Internet] [Masters thesis]. California State University – Sacramento; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10211.9/1276.

Council of Science Editors:

Shah P. Net camera interface using Rabbit Microprocessor development board RCM3365. [Masters Thesis]. California State University – Sacramento; 2011. Available from: http://hdl.handle.net/10211.9/1276


New Jersey Institute of Technology

7. Hoon, Michael. Exploring the potential usefulness of binary space partitions in architectural representations.

Degree: MSin Architectural Studies - (M.S.A.S.), School of Architecture, 2001, New Jersey Institute of Technology

  There have been recent advances developed within the computer gaming industry that have made real-time first-person perspective spatial experiences feasible on the personal computer.… (more)

Subjects/Keywords: Binary space partitions; architectural design; virtual reality; Architecture

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hoon, M. (2001). Exploring the potential usefulness of binary space partitions in architectural representations. (Thesis). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/theses/751

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

Hoon, Michael. “Exploring the potential usefulness of binary space partitions in architectural representations.” 2001. Thesis, New Jersey Institute of Technology. Accessed July 11, 2020. https://digitalcommons.njit.edu/theses/751.

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

MLA Handbook (7th Edition):

Hoon, Michael. “Exploring the potential usefulness of binary space partitions in architectural representations.” 2001. Web. 11 Jul 2020.

Vancouver:

Hoon M. Exploring the potential usefulness of binary space partitions in architectural representations. [Internet] [Thesis]. New Jersey Institute of Technology; 2001. [cited 2020 Jul 11]. Available from: https://digitalcommons.njit.edu/theses/751.

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

Council of Science Editors:

Hoon M. Exploring the potential usefulness of binary space partitions in architectural representations. [Thesis]. New Jersey Institute of Technology; 2001. Available from: https://digitalcommons.njit.edu/theses/751

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


Dalhousie University

8. Li, Mengdu. Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees.

Degree: Master of Computer Science, Faculty of Computer Science, 2016, Dalhousie University

 We present a provably linearizable and lock-free relaxed AVL tree called the non- blocking ravl tree. At any time, the height of a non-blocking ravl… (more)

Subjects/Keywords: concurrent data structure; non-blocking; self-balancing binary search tree; relaxed AVL tree; amortized complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, M. (2016). Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/71623

Chicago Manual of Style (16th Edition):

Li, Mengdu. “Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees.” 2016. Masters Thesis, Dalhousie University. Accessed July 11, 2020. http://hdl.handle.net/10222/71623.

MLA Handbook (7th Edition):

Li, Mengdu. “Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees.” 2016. Web. 11 Jul 2020.

Vancouver:

Li M. Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees. [Internet] [Masters thesis]. Dalhousie University; 2016. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10222/71623.

Council of Science Editors:

Li M. Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees. [Masters Thesis]. Dalhousie University; 2016. Available from: http://hdl.handle.net/10222/71623

9. Zhao, Boning. A THEORETIC APPROACH FOR BINARY GAME TREE EVALUATION.

Degree: MSs, EECS - Computer and Information Sciences, 2020, Case Western Reserve University School of Graduate Studies

 The Binary game tree model is perhaps the simplest model that computes Boolean functions: it charges only for reading an input variable. We proposed a… (more)

Subjects/Keywords: Computer Science; Game Theory, Binary Game Tree, Minimax Principle, Game Tree Evaluation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, B. (2020). A THEORETIC APPROACH FOR BINARY GAME TREE EVALUATION. (Masters Thesis). Case Western Reserve University School of Graduate Studies. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1586520140611046

Chicago Manual of Style (16th Edition):

Zhao, Boning. “A THEORETIC APPROACH FOR BINARY GAME TREE EVALUATION.” 2020. Masters Thesis, Case Western Reserve University School of Graduate Studies. Accessed July 11, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=case1586520140611046.

MLA Handbook (7th Edition):

Zhao, Boning. “A THEORETIC APPROACH FOR BINARY GAME TREE EVALUATION.” 2020. Web. 11 Jul 2020.

Vancouver:

Zhao B. A THEORETIC APPROACH FOR BINARY GAME TREE EVALUATION. [Internet] [Masters thesis]. Case Western Reserve University School of Graduate Studies; 2020. [cited 2020 Jul 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1586520140611046.

Council of Science Editors:

Zhao B. A THEORETIC APPROACH FOR BINARY GAME TREE EVALUATION. [Masters Thesis]. Case Western Reserve University School of Graduate Studies; 2020. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1586520140611046


Louisiana State University

10. Ding, Song. Optimal binary trees with height restrictions on left and right branches.

Degree: MS, Applied Mathematics, 2006, Louisiana State University

 We begin with background definitions on binary trees. Then we review known algorithms for finding optimal binary search trees. Knuth's famous algorithm, presented in the… (more)

Subjects/Keywords: knuth's algorithm; binary search tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, S. (2006). Optimal binary trees with height restrictions on left and right branches. (Masters Thesis). Louisiana State University. Retrieved from etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217

Chicago Manual of Style (16th Edition):

Ding, Song. “Optimal binary trees with height restrictions on left and right branches.” 2006. Masters Thesis, Louisiana State University. Accessed July 11, 2020. etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217.

MLA Handbook (7th Edition):

Ding, Song. “Optimal binary trees with height restrictions on left and right branches.” 2006. Web. 11 Jul 2020.

Vancouver:

Ding S. Optimal binary trees with height restrictions on left and right branches. [Internet] [Masters thesis]. Louisiana State University; 2006. [cited 2020 Jul 11]. Available from: etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217.

Council of Science Editors:

Ding S. Optimal binary trees with height restrictions on left and right branches. [Masters Thesis]. Louisiana State University; 2006. Available from: etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217


KTH

11. Leandersson, Viktor. GENVO: GENE EVOLUTIONVISUALIZATION : A 3D reconciliation software for phylogenies.

Degree: MID, 2016, KTH

Gene evolution is important in several areas, not least the understanding of thehuman body. Since the time of Darwin, researchers have visualized evolution withrooted… (more)

Subjects/Keywords: Visualization 3D Phylogenies binary tree reconciliation; Media and Communication Technology; Medieteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Leandersson, V. (2016). GENVO: GENE EVOLUTIONVISUALIZATION : A 3D reconciliation software for phylogenies. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189179

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

Leandersson, Viktor. “GENVO: GENE EVOLUTIONVISUALIZATION : A 3D reconciliation software for phylogenies.” 2016. Thesis, KTH. Accessed July 11, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189179.

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

MLA Handbook (7th Edition):

Leandersson, Viktor. “GENVO: GENE EVOLUTIONVISUALIZATION : A 3D reconciliation software for phylogenies.” 2016. Web. 11 Jul 2020.

Vancouver:

Leandersson V. GENVO: GENE EVOLUTIONVISUALIZATION : A 3D reconciliation software for phylogenies. [Internet] [Thesis]. KTH; 2016. [cited 2020 Jul 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189179.

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

Council of Science Editors:

Leandersson V. GENVO: GENE EVOLUTIONVISUALIZATION : A 3D reconciliation software for phylogenies. [Thesis]. KTH; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189179

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


Clemson University

12. Kenyon, Catherine Mary. The Calkin-Wilf Tree and Its Various Properties.

Degree: MS, Mathematical Sciences, 2019, Clemson University

  The Tree of All Fractions, otherwise known as the Calkin-Wilf tree, gets its name from the fact that every reduced positive rational appears once… (more)

Subjects/Keywords: Binary; Calkin-Wilf Tree; Combinatorics; hyperbinary; Number Theory; Rational

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kenyon, C. M. (2019). The Calkin-Wilf Tree and Its Various Properties. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/3075

Chicago Manual of Style (16th Edition):

Kenyon, Catherine Mary. “The Calkin-Wilf Tree and Its Various Properties.” 2019. Masters Thesis, Clemson University. Accessed July 11, 2020. https://tigerprints.clemson.edu/all_theses/3075.

MLA Handbook (7th Edition):

Kenyon, Catherine Mary. “The Calkin-Wilf Tree and Its Various Properties.” 2019. Web. 11 Jul 2020.

Vancouver:

Kenyon CM. The Calkin-Wilf Tree and Its Various Properties. [Internet] [Masters thesis]. Clemson University; 2019. [cited 2020 Jul 11]. Available from: https://tigerprints.clemson.edu/all_theses/3075.

Council of Science Editors:

Kenyon CM. The Calkin-Wilf Tree and Its Various Properties. [Masters Thesis]. Clemson University; 2019. Available from: https://tigerprints.clemson.edu/all_theses/3075

13. Valero Valbuena, Silvia. Arbre de partition binaire : un nouvel outil pour la représentation hiérarchique et l’analyse des images hyperspectrales : Binary partition tree for hyperspectral imaging.

Degree: Docteur es, Signal, image, paroles, télécoms, 2011, Grenoble; Universitat politécnica de Catalunya

Résumé non communiqué par le doctorant.

The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. Therefore,… (more)

Subjects/Keywords: Arbre binaire de partitions; Imagerie hyperspectrale; Filtrage; Segmentation; Teledetection; Partition tree; Hyperspectral imagery; Filtering; Segmentation; Remote sensing; 620

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Valero Valbuena, S. (2011). Arbre de partition binaire : un nouvel outil pour la représentation hiérarchique et l’analyse des images hyperspectrales : Binary partition tree for hyperspectral imaging. (Doctoral Dissertation). Grenoble; Universitat politécnica de Catalunya. Retrieved from http://www.theses.fr/2011GRENT123

Chicago Manual of Style (16th Edition):

Valero Valbuena, Silvia. “Arbre de partition binaire : un nouvel outil pour la représentation hiérarchique et l’analyse des images hyperspectrales : Binary partition tree for hyperspectral imaging.” 2011. Doctoral Dissertation, Grenoble; Universitat politécnica de Catalunya. Accessed July 11, 2020. http://www.theses.fr/2011GRENT123.

MLA Handbook (7th Edition):

Valero Valbuena, Silvia. “Arbre de partition binaire : un nouvel outil pour la représentation hiérarchique et l’analyse des images hyperspectrales : Binary partition tree for hyperspectral imaging.” 2011. Web. 11 Jul 2020.

Vancouver:

Valero Valbuena S. Arbre de partition binaire : un nouvel outil pour la représentation hiérarchique et l’analyse des images hyperspectrales : Binary partition tree for hyperspectral imaging. [Internet] [Doctoral dissertation]. Grenoble; Universitat politécnica de Catalunya; 2011. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2011GRENT123.

Council of Science Editors:

Valero Valbuena S. Arbre de partition binaire : un nouvel outil pour la représentation hiérarchique et l’analyse des images hyperspectrales : Binary partition tree for hyperspectral imaging. [Doctoral Dissertation]. Grenoble; Universitat politécnica de Catalunya; 2011. Available from: http://www.theses.fr/2011GRENT123

14. ZHENG YU. Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem.

Degree: 2014, National University of Singapore

Subjects/Keywords: algorithms gene-tree species-tree reconciliation non-binary refinement

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

YU, Z. (2014). Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/118278

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

YU, ZHENG. “Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem.” 2014. Thesis, National University of Singapore. Accessed July 11, 2020. http://scholarbank.nus.edu.sg/handle/10635/118278.

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

MLA Handbook (7th Edition):

YU, ZHENG. “Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem.” 2014. Web. 11 Jul 2020.

Vancouver:

YU Z. Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem. [Internet] [Thesis]. National University of Singapore; 2014. [cited 2020 Jul 11]. Available from: http://scholarbank.nus.edu.sg/handle/10635/118278.

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

Council of Science Editors:

YU Z. Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem. [Thesis]. National University of Singapore; 2014. Available from: http://scholarbank.nus.edu.sg/handle/10635/118278

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


Ohio University

15. Nedunchelliyan, Chitra. Peer-to-Peer Directory Service in Resource Area Network.

Degree: MS, Computer Science (Engineering), 2007, Ohio University

 This research effort involves designing and implementing a resource directory (RD) for a Resource Area Network (RAN). The resource directory is an application that performs… (more)

Subjects/Keywords: Computer Science; Resource Area Network; Resource Directory; Balanced Binary Tree; RAN; RAN RD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nedunchelliyan, C. (2007). Peer-to-Peer Directory Service in Resource Area Network. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1194935888

Chicago Manual of Style (16th Edition):

Nedunchelliyan, Chitra. “Peer-to-Peer Directory Service in Resource Area Network.” 2007. Masters Thesis, Ohio University. Accessed July 11, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1194935888.

MLA Handbook (7th Edition):

Nedunchelliyan, Chitra. “Peer-to-Peer Directory Service in Resource Area Network.” 2007. Web. 11 Jul 2020.

Vancouver:

Nedunchelliyan C. Peer-to-Peer Directory Service in Resource Area Network. [Internet] [Masters thesis]. Ohio University; 2007. [cited 2020 Jul 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1194935888.

Council of Science Editors:

Nedunchelliyan C. Peer-to-Peer Directory Service in Resource Area Network. [Masters Thesis]. Ohio University; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1194935888


Stellenbosch University

16. Dadedzi, Kenneth. Analysis of tree spectra.

Degree: PhD, Mathematical Sciences, 2018, Stellenbosch University

ENGLISH ABSTRACT : We study the set of eigenvalues (spectrum) of the adjacency matrix, Laplacian matrix and the distance matrix of trees. In particular, we… (more)

Subjects/Keywords: Binary system (Mathematics); Eigenvalues; Laplacian matrices; Trees (Graph theory); UCTD; Tree spectra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dadedzi, K. (2018). Analysis of tree spectra. (Doctoral Dissertation). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/104848

Chicago Manual of Style (16th Edition):

Dadedzi, Kenneth. “Analysis of tree spectra.” 2018. Doctoral Dissertation, Stellenbosch University. Accessed July 11, 2020. http://hdl.handle.net/10019.1/104848.

MLA Handbook (7th Edition):

Dadedzi, Kenneth. “Analysis of tree spectra.” 2018. Web. 11 Jul 2020.

Vancouver:

Dadedzi K. Analysis of tree spectra. [Internet] [Doctoral dissertation]. Stellenbosch University; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10019.1/104848.

Council of Science Editors:

Dadedzi K. Analysis of tree spectra. [Doctoral Dissertation]. Stellenbosch University; 2018. Available from: http://hdl.handle.net/10019.1/104848


Brno University of Technology

17. Trávníček, Jiří. Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning.

Degree: 2020, Brno University of Technology

 The main objective of this work is to design and implement an application that can be used as an aid for the education of programming… (more)

Subjects/Keywords: datové struktury; dynamické datové struktury; zásobník; fronta; seznam; strom; binární strom; binární vyhledávací strom; WWW prohlížeč; DHTML; HTML; CSS; DOM; JavaScript; data structures; dynamic data structures; stack; queue; list; tree; binary tree; binary search tree; WWW browser; DHTML; HTML; CSS; DOM; JavaScript

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Trávníček, J. (2020). Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187780

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

Trávníček, Jiří. “Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning.” 2020. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/187780.

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

MLA Handbook (7th Edition):

Trávníček, Jiří. “Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning.” 2020. Web. 11 Jul 2020.

Vancouver:

Trávníček J. Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/187780.

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

Council of Science Editors:

Trávníček J. Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187780

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


Brno University of Technology

18. Trávníček, Jiří. Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning.

Degree: 2020, Brno University of Technology

 The main objective of this work is to design and implement an application that can be used as an aid for the education of programming… (more)

Subjects/Keywords: datové struktury; dynamické datové struktury; zásobník; fronta; seznam; strom; binární strom; binární vyhledávací strom; WWW prohlížeč; DHTML; HTML; CSS; DOM; JavaScript; data structures; dynamic data structures; stack; queue; list; tree; binary tree; binary search tree; WWW browser; DHTML; HTML; CSS; DOM; JavaScript

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Trávníček, J. (2020). Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54004

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

Trávníček, Jiří. “Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning.” 2020. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/54004.

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

MLA Handbook (7th Edition):

Trávníček, Jiří. “Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning.” 2020. Web. 11 Jul 2020.

Vancouver:

Trávníček J. Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/54004.

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

Council of Science Editors:

Trávníček J. Systém pro podporu výuky dynamických datových struktur: System for Support of Dynamic Data Structures Learning. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/54004

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


Brno University of Technology

19. Sedlář, František. Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms.

Degree: 2019, Brno University of Technology

 This master's thesis explains basics of the longest prefix match (LPM) problem. It analyzes and describes chosen LPM algorithms considering their speed, memory requirements and… (more)

Subjects/Keywords: nejdelší shodný prefix; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; Hash Tree Bitmap; Generic Hash Tree Bitmap; binární vyhledávání na intervalech; binární vyhledávání na prefixech; longest prefix match; LPM; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; Hash Tree Bitmap; Generic Hash Tree Bitmap; Binary Search on Intervals; Binary Search on Prefixes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sedlář, F. (2019). Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53506

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

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms.” 2019. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/53506.

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

MLA Handbook (7th Edition):

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms.” 2019. Web. 11 Jul 2020.

Vancouver:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/53506.

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

Council of Science Editors:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53506

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


Universidade do Rio Grande do Sul

20. Andreola, Rafaela. Support Vector Machines na classificação de imagens hiperespectrais.

Degree: 2009, Universidade do Rio Grande do Sul

É de conhecimento geral que, em alguns casos, as classes são espectralmente muito similares e que não é possível separá-las usando dados convencionais em baixa… (more)

Subjects/Keywords: Gaussian maximum likelihood; Sensoriamento remoto; Imagens hiperespectrais; Binary tree classify; High-dimensional image data; Remote sensing; SVM

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Andreola, R. (2009). Support Vector Machines na classificação de imagens hiperespectrais. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/17894

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

Andreola, Rafaela. “Support Vector Machines na classificação de imagens hiperespectrais.” 2009. Thesis, Universidade do Rio Grande do Sul. Accessed July 11, 2020. http://hdl.handle.net/10183/17894.

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

MLA Handbook (7th Edition):

Andreola, Rafaela. “Support Vector Machines na classificação de imagens hiperespectrais.” 2009. Web. 11 Jul 2020.

Vancouver:

Andreola R. Support Vector Machines na classificação de imagens hiperespectrais. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2009. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10183/17894.

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

Council of Science Editors:

Andreola R. Support Vector Machines na classificação de imagens hiperespectrais. [Thesis]. Universidade do Rio Grande do Sul; 2009. Available from: http://hdl.handle.net/10183/17894

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


NSYSU

21. Wen, Chia-Sheng. Logic Synthesis of High-Performance Combinational Circuits Based on Pass-Transistor Cell Library.

Degree: Master, Computer Science and Engineering, 2003, NSYSU

 This thesis proposes a new variable-order prediction method to predict the Shannon expansion order during the BDD tree generator. Combining this method with the original… (more)

Subjects/Keywords: Binary Decision Diagram Tree; BDD; Pass-Transistor Logic; Synthesizer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wen, C. (2003). Logic Synthesis of High-Performance Combinational Circuits Based on Pass-Transistor Cell Library. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902103-215924

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

Wen, Chia-Sheng. “Logic Synthesis of High-Performance Combinational Circuits Based on Pass-Transistor Cell Library.” 2003. Thesis, NSYSU. Accessed July 11, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902103-215924.

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

MLA Handbook (7th Edition):

Wen, Chia-Sheng. “Logic Synthesis of High-Performance Combinational Circuits Based on Pass-Transistor Cell Library.” 2003. Web. 11 Jul 2020.

Vancouver:

Wen C. Logic Synthesis of High-Performance Combinational Circuits Based on Pass-Transistor Cell Library. [Internet] [Thesis]. NSYSU; 2003. [cited 2020 Jul 11]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902103-215924.

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

Council of Science Editors:

Wen C. Logic Synthesis of High-Performance Combinational Circuits Based on Pass-Transistor Cell Library. [Thesis]. NSYSU; 2003. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902103-215924

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


University of Colorado

22. Ramirez, Jose Alberto. Essays on Military and Civilian Manpower Planning.

Degree: PhD, Operations & Information Management, 2015, University of Colorado

  Civilian and military manpower planning is commonly conducted by human resource (HR) planners having little or no experience using and developing quantitative methods. If… (more)

Subjects/Keywords: Binary Logistic Regression; Military Manpower; Newsvendor Approach; Retention Tree; Surrogate Data Representations; Workforce Planning; Business Administration, Management, and Operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramirez, J. A. (2015). Essays on Military and Civilian Manpower Planning. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/opim_gradetds/3

Chicago Manual of Style (16th Edition):

Ramirez, Jose Alberto. “Essays on Military and Civilian Manpower Planning.” 2015. Doctoral Dissertation, University of Colorado. Accessed July 11, 2020. https://scholar.colorado.edu/opim_gradetds/3.

MLA Handbook (7th Edition):

Ramirez, Jose Alberto. “Essays on Military and Civilian Manpower Planning.” 2015. Web. 11 Jul 2020.

Vancouver:

Ramirez JA. Essays on Military and Civilian Manpower Planning. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2020 Jul 11]. Available from: https://scholar.colorado.edu/opim_gradetds/3.

Council of Science Editors:

Ramirez JA. Essays on Military and Civilian Manpower Planning. [Doctoral Dissertation]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/opim_gradetds/3


University of Toronto

23. Zhang, Jenmy Zimi. Parallel Anisotropic Block-based Adaptive Mesh Refinement Finite-volume Scheme.

Degree: 2011, University of Toronto

A novel parallel block-based anisotropic adaptive mesh refinement (AMR) technique for multi-block body-fitted grids is proposed and described. Rather than adopting the more usual isotropic… (more)

Subjects/Keywords: adaptive mesh refinement; anisotropic; computational fluid dynamics; Binary Tree; advection diffusion; euler equations; finite-volume; 0538; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, J. Z. (2011). Parallel Anisotropic Block-based Adaptive Mesh Refinement Finite-volume Scheme. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/31658

Chicago Manual of Style (16th Edition):

Zhang, Jenmy Zimi. “Parallel Anisotropic Block-based Adaptive Mesh Refinement Finite-volume Scheme.” 2011. Masters Thesis, University of Toronto. Accessed July 11, 2020. http://hdl.handle.net/1807/31658.

MLA Handbook (7th Edition):

Zhang, Jenmy Zimi. “Parallel Anisotropic Block-based Adaptive Mesh Refinement Finite-volume Scheme.” 2011. Web. 11 Jul 2020.

Vancouver:

Zhang JZ. Parallel Anisotropic Block-based Adaptive Mesh Refinement Finite-volume Scheme. [Internet] [Masters thesis]. University of Toronto; 2011. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1807/31658.

Council of Science Editors:

Zhang JZ. Parallel Anisotropic Block-based Adaptive Mesh Refinement Finite-volume Scheme. [Masters Thesis]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/31658


University of the Western Cape

24. Dyakopu, Neliswa B. Discrete time methods of pricing Asian options .

Degree: 2014, University of the Western Cape

 This dissertation studies the computation methods of pricing of Asian options. Asian options are options in which the underlying variable is the average price over… (more)

Subjects/Keywords: Asian option; Basket option; Binary tree; Black-Scholes; Control variate; Cox-Ross-Rubinstein; Levy process; Monte Carlo; Lower bound; Stochastic volatility

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dyakopu, N. B. (2014). Discrete time methods of pricing Asian options . (Thesis). University of the Western Cape. Retrieved from http://hdl.handle.net/11394/3341

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

Dyakopu, Neliswa B. “Discrete time methods of pricing Asian options .” 2014. Thesis, University of the Western Cape. Accessed July 11, 2020. http://hdl.handle.net/11394/3341.

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

MLA Handbook (7th Edition):

Dyakopu, Neliswa B. “Discrete time methods of pricing Asian options .” 2014. Web. 11 Jul 2020.

Vancouver:

Dyakopu NB. Discrete time methods of pricing Asian options . [Internet] [Thesis]. University of the Western Cape; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11394/3341.

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

Council of Science Editors:

Dyakopu NB. Discrete time methods of pricing Asian options . [Thesis]. University of the Western Cape; 2014. Available from: http://hdl.handle.net/11394/3341

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


Brno University of Technology

25. Janečka, Jan. Generování matematických příkladů pro střední a základní školy: Generation of the Mathematical Excercises for High Schools and Elementary Schools.

Degree: 2018, Brno University of Technology

 This thesis is considering genetic algorithms as a~means for generating math exam exercises for elementary and high schools. There are two kinds of exercises implemented:… (more)

Subjects/Keywords: Evoluční algoritmy; binární strom; slovní úlohy; lineární rovnice; Evolutionary algorithms; binary tree; verbal rider; linear equations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Janečka, J. (2018). Generování matematických příkladů pro střední a základní školy: Generation of the Mathematical Excercises for High Schools and Elementary Schools. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53018

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

Janečka, Jan. “Generování matematických příkladů pro střední a základní školy: Generation of the Mathematical Excercises for High Schools and Elementary Schools.” 2018. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/53018.

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

MLA Handbook (7th Edition):

Janečka, Jan. “Generování matematických příkladů pro střední a základní školy: Generation of the Mathematical Excercises for High Schools and Elementary Schools.” 2018. Web. 11 Jul 2020.

Vancouver:

Janečka J. Generování matematických příkladů pro střední a základní školy: Generation of the Mathematical Excercises for High Schools and Elementary Schools. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/53018.

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

Council of Science Editors:

Janečka J. Generování matematických příkladů pro střední a základní školy: Generation of the Mathematical Excercises for High Schools and Elementary Schools. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53018

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


Brno University of Technology

26. Pyšný, Radek. Lidské rozhraní k automatovým knihovnám nástroje MONA: Human Interface to Automata Libraries of MONA Tool.

Degree: 2020, Brno University of Technology

 Finite tree automata is formalism used in many different areas of computer science, among others in the area of formal verification. Nowdays there are few… (more)

Subjects/Keywords: Formální verifikace; stromové automaty; binární rozhodovací diagramy; rozhraní.; Formal verification; tree automata; binary decision diagrams; interface.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pyšný, R. (2020). Lidské rozhraní k automatovým knihovnám nástroje MONA: Human Interface to Automata Libraries of MONA Tool. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187593

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

Pyšný, Radek. “Lidské rozhraní k automatovým knihovnám nástroje MONA: Human Interface to Automata Libraries of MONA Tool.” 2020. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/187593.

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

MLA Handbook (7th Edition):

Pyšný, Radek. “Lidské rozhraní k automatovým knihovnám nástroje MONA: Human Interface to Automata Libraries of MONA Tool.” 2020. Web. 11 Jul 2020.

Vancouver:

Pyšný R. Lidské rozhraní k automatovým knihovnám nástroje MONA: Human Interface to Automata Libraries of MONA Tool. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/187593.

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

Council of Science Editors:

Pyšný R. Lidské rozhraní k automatovým knihovnám nástroje MONA: Human Interface to Automata Libraries of MONA Tool. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187593

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


Brno University of Technology

27. Sedlář, František. Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms.

Degree: 2018, Brno University of Technology

 This bachelor's thesis deals with a description of basic longest prefix match (LPM) algorithms. Another algorithm - LC Trie - was added to existing implementations… (more)

Subjects/Keywords: nejdelší shodný prefix; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; binární vyhledávání na intervalech; binární vyhledávání na prefixech; longest prefix match; LPM; trie; LC Trie; Controlled Prefix Expansion; Lulea Compressed Trie; Tree Bitmap; Shape Shifting Tree; binary search on intervals; binary search on prefixes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sedlář, F. (2018). Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55852

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

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms.” 2018. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/55852.

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

MLA Handbook (7th Edition):

Sedlář, František. “Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms.” 2018. Web. 11 Jul 2020.

Vancouver:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/55852.

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

Council of Science Editors:

Sedlář F. Algoritmy pro vyhledání nejdelšího shodného prefixu: Longest Prefix Match Algorithms. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/55852

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


Brno University of Technology

28. Lengál, Ondřej. Efektivní knihovna pro práci s konečnými stromovými automaty: An Efficient Finite Tree Automata Library.

Degree: 2019, Brno University of Technology

 Numerous computer systems use dynamic control and data structures of unbounded size. These data structures have often the character of trees or they can be… (more)

Subjects/Keywords: stromové automaty; formální verifikace; abstraktní regulární stromový model checking; binární rozhodovací diagramy; multiterminálové binární rozhodovací diagramy; tree automata; formal verification; abstract regular tree model checking; binary decision diagrams; multiterminal binary decision diagrams

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lengál, O. (2019). Efektivní knihovna pro práci s konečnými stromovými automaty: An Efficient Finite Tree Automata Library. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54375

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

Lengál, Ondřej. “Efektivní knihovna pro práci s konečnými stromovými automaty: An Efficient Finite Tree Automata Library.” 2019. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/54375.

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

MLA Handbook (7th Edition):

Lengál, Ondřej. “Efektivní knihovna pro práci s konečnými stromovými automaty: An Efficient Finite Tree Automata Library.” 2019. Web. 11 Jul 2020.

Vancouver:

Lengál O. Efektivní knihovna pro práci s konečnými stromovými automaty: An Efficient Finite Tree Automata Library. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/54375.

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

Council of Science Editors:

Lengál O. Efektivní knihovna pro práci s konečnými stromovými automaty: An Efficient Finite Tree Automata Library. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/54375

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


Brno University of Technology

29. Nejezchleb, Ivan. Algoritmy vyhledávání v jazyce C: Search Algorithms in C Language.

Degree: 2019, Brno University of Technology

 Searching in all possible forms is at the present time widely used operation not only in the subject of information technology. So the understanding and… (more)

Subjects/Keywords: Vyhledávací algoritmy; sekvenční vyhledávání; binární vyhledávání; Dijkstrova varianta binárního vyhledávání; Fibonacciho vyhledávání; binární vyhledávací strom; tabulky s rozptýlenými položkami; demonstrační aplikace; Searching algorithms; sequential search; binary search; Dijkstra's modification of binary search; Fibonacci search; binary search tree; hashing tables; demo application

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nejezchleb, I. (2019). Algoritmy vyhledávání v jazyce C: Search Algorithms in C Language. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56315

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

Nejezchleb, Ivan. “Algoritmy vyhledávání v jazyce C: Search Algorithms in C Language.” 2019. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/56315.

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

MLA Handbook (7th Edition):

Nejezchleb, Ivan. “Algoritmy vyhledávání v jazyce C: Search Algorithms in C Language.” 2019. Web. 11 Jul 2020.

Vancouver:

Nejezchleb I. Algoritmy vyhledávání v jazyce C: Search Algorithms in C Language. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/56315.

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

Council of Science Editors:

Nejezchleb I. Algoritmy vyhledávání v jazyce C: Search Algorithms in C Language. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56315

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


University of Florida

30. Anderson, Anna E. Positive Deviance.

Degree: M.F.A., Creative Writing - English, 2017, University of Florida

 The following poems blend details from my own physical and emotional experiences with botanical research and observation of nature in the hope of representing what… (more)

Subjects/Keywords: tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anderson, A. E. (2017). Positive Deviance. (Masters Thesis). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0051934

Chicago Manual of Style (16th Edition):

Anderson, Anna E. “Positive Deviance.” 2017. Masters Thesis, University of Florida. Accessed July 11, 2020. https://ufdc.ufl.edu/UFE0051934.

MLA Handbook (7th Edition):

Anderson, Anna E. “Positive Deviance.” 2017. Web. 11 Jul 2020.

Vancouver:

Anderson AE. Positive Deviance. [Internet] [Masters thesis]. University of Florida; 2017. [cited 2020 Jul 11]. Available from: https://ufdc.ufl.edu/UFE0051934.

Council of Science Editors:

Anderson AE. Positive Deviance. [Masters Thesis]. University of Florida; 2017. Available from: https://ufdc.ufl.edu/UFE0051934

[1] [2] [3] [4] [5] … [188]

.