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

Dates: 2015 – 2019

You searched for subject:( Suffix tree algorithm). Showing records 1 – 30 of 3248 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Brno University of Technology

1. Klouba, Lukáš. Celogenomové zarovnání pomocí suffixových stromů .

Degree: 2017, Brno University of Technology

 Cílem této práce je vytvořit algoritmus, který pomocí sufixových konstrukcí umožní zarovnání genomu dvou organismů, a implementovat jej do programového prostředí jazyka R. Práce se… (more)

Subjects/Keywords: sufixové stromy; sufixová pole; Ukkonenův algoritmus; R; celogenomové zarovnání; suffix tree; suffix array; Ukkonen’s algorithm; R; whole-genome alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Klouba, L. (2017). Celogenomové zarovnání pomocí suffixových stromů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/65466

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

Klouba, Lukáš. “Celogenomové zarovnání pomocí suffixových stromů .” 2017. Thesis, Brno University of Technology. Accessed October 21, 2019. http://hdl.handle.net/11012/65466.

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

MLA Handbook (7th Edition):

Klouba, Lukáš. “Celogenomové zarovnání pomocí suffixových stromů .” 2017. Web. 21 Oct 2019.

Vancouver:

Klouba L. Celogenomové zarovnání pomocí suffixových stromů . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/11012/65466.

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

Council of Science Editors:

Klouba L. Celogenomové zarovnání pomocí suffixových stromů . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/65466

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


University of Manitoba

2. Devanarayana, Chamara. Spectrum access in cognitive radio networks based on prediction and estimation.

Degree: Electrical and Computer Engineering, 2015, University of Manitoba

 In the literature, Cognitive radio (CR) as well as full-duplex (FD) communication technologies are proposed to increase the spectrum efficiency. The main contribution of this… (more)

Subjects/Keywords: Cognitive Radio; Overlay networks; Underlay networks; Prediction and estimation; Probabilistic suffix tree algorithm; Monotonic optimization; Resource allocation; D2D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Devanarayana, C. (2015). Spectrum access in cognitive radio networks based on prediction and estimation. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31605

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

Devanarayana, Chamara. “Spectrum access in cognitive radio networks based on prediction and estimation.” 2015. Thesis, University of Manitoba. Accessed October 21, 2019. http://hdl.handle.net/1993/31605.

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

MLA Handbook (7th Edition):

Devanarayana, Chamara. “Spectrum access in cognitive radio networks based on prediction and estimation.” 2015. Web. 21 Oct 2019.

Vancouver:

Devanarayana C. Spectrum access in cognitive radio networks based on prediction and estimation. [Internet] [Thesis]. University of Manitoba; 2015. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/1993/31605.

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

Council of Science Editors:

Devanarayana C. Spectrum access in cognitive radio networks based on prediction and estimation. [Thesis]. University of Manitoba; 2015. Available from: http://hdl.handle.net/1993/31605

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


Georgia Tech

3. Flick, Patrick. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.

Degree: PhD, Computational Science and Engineering, 2019, Georgia Tech

 Methods for processing and analyzing DNA and genomic data are built upon combinatorial graph and string algorithms. The advent of high-throughput DNA sequencing is enabling… (more)

Subjects/Keywords: distributed memory; suffix array; suffix tree; enhanced suffix arrays; de bruijn graphs; distributed graphs; connected components

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Flick, P. (2019). Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61257

Chicago Manual of Style (16th Edition):

Flick, Patrick. “Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.” 2019. Doctoral Dissertation, Georgia Tech. Accessed October 21, 2019. http://hdl.handle.net/1853/61257.

MLA Handbook (7th Edition):

Flick, Patrick. “Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.” 2019. Web. 21 Oct 2019.

Vancouver:

Flick P. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/1853/61257.

Council of Science Editors:

Flick P. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61257


Washington State University

4. [No author]. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .

Degree: 2015, Washington State University

 The field of bioinformatics and computational biology is currently experiencing a data revolution. The exciting prospect of making fundamental biological discoveries is fueling the rapid… (more)

Subjects/Keywords: Computer science; Bioinformatics; metagenomics; sequence alignment; SIMD; suffix tree; work stealing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2015). SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/5503

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

author], [No. “SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .” 2015. Thesis, Washington State University. Accessed October 21, 2019. http://hdl.handle.net/2376/5503.

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

MLA Handbook (7th Edition):

author], [No. “SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .” 2015. Web. 21 Oct 2019.

Vancouver:

author] [. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . [Internet] [Thesis]. Washington State University; 2015. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/2376/5503.

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

Council of Science Editors:

author] [. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . [Thesis]. Washington State University; 2015. Available from: http://hdl.handle.net/2376/5503

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


NSYSU

5. Lin, Bi-Shiang. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.

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

 Given two sequences A and B of lengths m and n, respectively, the consecutive suffix alignment problem is to compute the longest common subsequence (LCS)… (more)

Subjects/Keywords: S-table; linear space; consecutive suffix alignment problem; longest common subsequence; range query; segment tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, B. (2017). The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

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

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

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

MLA Handbook (7th Edition):

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Web. 21 Oct 2019.

Vancouver:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

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

Council of Science Editors:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

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


NSYSU

6. Liao, Zhi-Feng. An Efficient Algorithm for Mining Repeating Patterns.

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

 A repeating pattern is composed of identifiable elements that repeat in a predictable manner. In our real life, there are lots of applications such as… (more)

Subjects/Keywords: suffix tree; repeating pattern; fast mining of repeating patterns; data mining; repeating-pattern-index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, Z. (2016). An Efficient Algorithm for Mining Repeating Patterns. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911

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

Liao, Zhi-Feng. “An Efficient Algorithm for Mining Repeating Patterns.” 2016. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911.

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

MLA Handbook (7th Edition):

Liao, Zhi-Feng. “An Efficient Algorithm for Mining Repeating Patterns.” 2016. Web. 21 Oct 2019.

Vancouver:

Liao Z. An Efficient Algorithm for Mining Repeating Patterns. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911.

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

Council of Science Editors:

Liao Z. An Efficient Algorithm for Mining Repeating Patterns. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911

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


Universiteit Utrecht

7. Eeden, J.G. van. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.

Degree: 2015, Universiteit Utrecht

 In the ongoing strive to reach human-level intelligence with intelligent agents, it has become clear that the agents should be able to deal with a… (more)

Subjects/Keywords: Monte Carlo Tree Search; MCTS; AI; Artificial Intelligence; algorithm; tree search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eeden, J. G. v. (2015). Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/315915

Chicago Manual of Style (16th Edition):

Eeden, J G van. “Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.” 2015. Masters Thesis, Universiteit Utrecht. Accessed October 21, 2019. http://dspace.library.uu.nl:8080/handle/1874/315915.

MLA Handbook (7th Edition):

Eeden, J G van. “Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.” 2015. Web. 21 Oct 2019.

Vancouver:

Eeden JGv. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Oct 21]. Available from: http://dspace.library.uu.nl:8080/handle/1874/315915.

Council of Science Editors:

Eeden JGv. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/315915


Delft University of Technology

8. De Bokx, R. Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:.

Degree: 2015, Delft University of Technology

 The recently introduced Linkage Tree Genetic Algorithm (LTGA) has shown to exhibit excellent scalability on a variety of optimization problems. LTGA employs Linkage Trees (LTs)… (more)

Subjects/Keywords: parallel; optimization; modeling; LTGA; Linkage Tree; Linkage Tree Genetic Algorithm; model optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Bokx, R. (2015). Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382

Chicago Manual of Style (16th Edition):

De Bokx, R. “Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:.” 2015. Masters Thesis, Delft University of Technology. Accessed October 21, 2019. http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382.

MLA Handbook (7th Edition):

De Bokx, R. “Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:.” 2015. Web. 21 Oct 2019.

Vancouver:

De Bokx R. Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Oct 21]. Available from: http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382.

Council of Science Editors:

De Bokx R. Parallelizing the Linkage Tree Genetic Algorithm and Searching for the Optimal Replacement for the Linkage Tree:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:6cf6c908-0f5d-4096-b3ad-aa96fd1ff382


Universidade Nova

9. Costa, Jorge André Nogueira da. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.

Degree: 2017, Universidade Nova

 The amount of digital natural language text collections available nowadays is huge and it has been growing at an exponential rate. All this information can… (more)

Subjects/Keywords: Bilingual texts; Byte-codesWavelet Tree; Suffix Array; Machine Translation; Bilingual Framework; bilingual search; Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Costa, J. A. N. d. (2017). Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929

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

Costa, Jorge André Nogueira da. “Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.” 2017. Thesis, Universidade Nova. Accessed October 21, 2019. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929.

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

MLA Handbook (7th Edition):

Costa, Jorge André Nogueira da. “Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.” 2017. Web. 21 Oct 2019.

Vancouver:

Costa JANd. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. [Internet] [Thesis]. Universidade Nova; 2017. [cited 2019 Oct 21]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929.

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

Council of Science Editors:

Costa JANd. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. [Thesis]. Universidade Nova; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929

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


UCLA

10. Ding, Fan. Click Prediction with Machine Learning Tools.

Degree: Statistics, 2018, UCLA

 In this paper, we will explore multiple machine learning tools with their applications in the industry of advertisement technology. Companies like Sabio Mobile Inc. aim… (more)

Subjects/Keywords: Statistics; Advertising Technology; Logistic Regression; Machine Learning; Neural Network; Tree Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, F. (2018). Click Prediction with Machine Learning Tools. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/0cf772s3

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

Ding, Fan. “Click Prediction with Machine Learning Tools.” 2018. Thesis, UCLA. Accessed October 21, 2019. http://www.escholarship.org/uc/item/0cf772s3.

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

MLA Handbook (7th Edition):

Ding, Fan. “Click Prediction with Machine Learning Tools.” 2018. Web. 21 Oct 2019.

Vancouver:

Ding F. Click Prediction with Machine Learning Tools. [Internet] [Thesis]. UCLA; 2018. [cited 2019 Oct 21]. Available from: http://www.escholarship.org/uc/item/0cf772s3.

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

Council of Science Editors:

Ding F. Click Prediction with Machine Learning Tools. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/0cf772s3

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


Kansas State University

11. Clemens, Jason. Spanning tree modulus: deflation and a hierarchical graph structure.

Degree: PhD, Department of Mathematics, 2018, Kansas State University

 The concept of discrete p-modulus provides a general framework for understanding arbitrary families of objects on a graph. The p-modulus provides a sense of ``structure''… (more)

Subjects/Keywords: Modulus; Spanning tree; Minimum spanning trees; Graph structure; Greedy algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clemens, J. (2018). Spanning tree modulus: deflation and a hierarchical graph structure. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/39115

Chicago Manual of Style (16th Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Doctoral Dissertation, Kansas State University. Accessed October 21, 2019. http://hdl.handle.net/2097/39115.

MLA Handbook (7th Edition):

Clemens, Jason. “Spanning tree modulus: deflation and a hierarchical graph structure.” 2018. Web. 21 Oct 2019.

Vancouver:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Internet] [Doctoral dissertation]. Kansas State University; 2018. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/2097/39115.

Council of Science Editors:

Clemens J. Spanning tree modulus: deflation and a hierarchical graph structure. [Doctoral Dissertation]. Kansas State University; 2018. Available from: http://hdl.handle.net/2097/39115


University of Miami

12. Yu, Huilin. New Methods for Disparity Estimation.

Degree: PhD, Biostatistics (Medicine), 2019, University of Miami

 Health disparity is an important public health policy concern as it is related to the social inequalities in population health, not only for the persons… (more)

Subjects/Keywords: disparity estimation; tree-based algorithm; individual and environmental factor interaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, H. (2019). New Methods for Disparity Estimation. (Doctoral Dissertation). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_dissertations/2365

Chicago Manual of Style (16th Edition):

Yu, Huilin. “New Methods for Disparity Estimation.” 2019. Doctoral Dissertation, University of Miami. Accessed October 21, 2019. https://scholarlyrepository.miami.edu/oa_dissertations/2365.

MLA Handbook (7th Edition):

Yu, Huilin. “New Methods for Disparity Estimation.” 2019. Web. 21 Oct 2019.

Vancouver:

Yu H. New Methods for Disparity Estimation. [Internet] [Doctoral dissertation]. University of Miami; 2019. [cited 2019 Oct 21]. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2365.

Council of Science Editors:

Yu H. New Methods for Disparity Estimation. [Doctoral Dissertation]. University of Miami; 2019. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2365

13. Juuso, Lina. Procedural generation of imaginative trees using a space colonization algorithm.

Degree: Design and Engineering, 2017, Mälardalen University

  The modeling of trees is challenging due to their complex branching structures. Three different ways to generate trees are using real world data for… (more)

Subjects/Keywords: tree modeling; procedural content generation; space colonization algorithm; procedural modeling; tree generation; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Juuso, L. (2017). Procedural generation of imaginative trees using a space colonization algorithm. (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35577

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

Juuso, Lina. “Procedural generation of imaginative trees using a space colonization algorithm.” 2017. Thesis, Mälardalen University. Accessed October 21, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35577.

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

MLA Handbook (7th Edition):

Juuso, Lina. “Procedural generation of imaginative trees using a space colonization algorithm.” 2017. Web. 21 Oct 2019.

Vancouver:

Juuso L. Procedural generation of imaginative trees using a space colonization algorithm. [Internet] [Thesis]. Mälardalen University; 2017. [cited 2019 Oct 21]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35577.

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

Council of Science Editors:

Juuso L. Procedural generation of imaginative trees using a space colonization algorithm. [Thesis]. Mälardalen University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35577

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

14. He, Xi. TEXT AND SPATIAL-TEMPORAL DATA VISUALIZATION.

Degree: PhD, Computer Science, 2016, Georgia State University

  In this dissertation, we discuss a text visualization system, a tree drawing algorithm, a spatial-temporal data visualization paradigm and a tennis match visualization system.… (more)

Subjects/Keywords: Text Visualization; Spatial-Temporal Data Visualization; Storytelling; Storygraph; Tree Drawing Algorithm; Tennis Match Visualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, X. (2016). TEXT AND SPATIAL-TEMPORAL DATA VISUALIZATION. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/109

Chicago Manual of Style (16th Edition):

He, Xi. “TEXT AND SPATIAL-TEMPORAL DATA VISUALIZATION.” 2016. Doctoral Dissertation, Georgia State University. Accessed October 21, 2019. https://scholarworks.gsu.edu/cs_diss/109.

MLA Handbook (7th Edition):

He, Xi. “TEXT AND SPATIAL-TEMPORAL DATA VISUALIZATION.” 2016. Web. 21 Oct 2019.

Vancouver:

He X. TEXT AND SPATIAL-TEMPORAL DATA VISUALIZATION. [Internet] [Doctoral dissertation]. Georgia State University; 2016. [cited 2019 Oct 21]. Available from: https://scholarworks.gsu.edu/cs_diss/109.

Council of Science Editors:

He X. TEXT AND SPATIAL-TEMPORAL DATA VISUALIZATION. [Doctoral Dissertation]. Georgia State University; 2016. Available from: https://scholarworks.gsu.edu/cs_diss/109


Wright State University

15. Xia, Tian. Learning to Rank Algorithms and Their Application in Machine Translation.

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

 In this thesis, we discuss two issues in the learning to rank area, choosing effective objective loss function, constructing effective regresstion trees in thegradient boosting… (more)

Subjects/Keywords: Computer Engineering; learning to rank; boosting; regression tree; algorithm analysis; machine translation; training

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xia, T. (2015). Learning to Rank Algorithms and Their Application in Machine Translation. (Doctoral Dissertation). Wright State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=wright1451610555

Chicago Manual of Style (16th Edition):

Xia, Tian. “Learning to Rank Algorithms and Their Application in Machine Translation.” 2015. Doctoral Dissertation, Wright State University. Accessed October 21, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1451610555.

MLA Handbook (7th Edition):

Xia, Tian. “Learning to Rank Algorithms and Their Application in Machine Translation.” 2015. Web. 21 Oct 2019.

Vancouver:

Xia T. Learning to Rank Algorithms and Their Application in Machine Translation. [Internet] [Doctoral dissertation]. Wright State University; 2015. [cited 2019 Oct 21]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1451610555.

Council of Science Editors:

Xia T. Learning to Rank Algorithms and Their Application in Machine Translation. [Doctoral Dissertation]. Wright State University; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=wright1451610555

16. Crotti, Stefania. Modeling Players Personality in General Game Playing .

Degree: Chalmers tekniska högskola / Institutionen för data och informationsvetenskap, 2018, Chalmers University of Technology

 Artificial agents’ skills need to become more relatable to humans’, and one approach to solve this problem would be to associate a personality to the… (more)

Subjects/Keywords: General Game Playing; Monte Carlo Tree Search; Genetic Algorithm; Personality Mapping; Bayesian Modeling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Crotti, S. (2018). Modeling Players Personality in General Game Playing . (Thesis). Chalmers University of Technology. Retrieved from http://hdl.handle.net/20.500.12380/300299

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

Crotti, Stefania. “Modeling Players Personality in General Game Playing .” 2018. Thesis, Chalmers University of Technology. Accessed October 21, 2019. http://hdl.handle.net/20.500.12380/300299.

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

MLA Handbook (7th Edition):

Crotti, Stefania. “Modeling Players Personality in General Game Playing .” 2018. Web. 21 Oct 2019.

Vancouver:

Crotti S. Modeling Players Personality in General Game Playing . [Internet] [Thesis]. Chalmers University of Technology; 2018. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/20.500.12380/300299.

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

Council of Science Editors:

Crotti S. Modeling Players Personality in General Game Playing . [Thesis]. Chalmers University of Technology; 2018. Available from: http://hdl.handle.net/20.500.12380/300299

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


Louisiana State University

17. Krishnan, Ambujam. Phylogenetic Tree Construction for Starfish and Primate Genomes via Alignment Free Methods.

Degree: MSCS, Computer Sciences, 2015, Louisiana State University

 A phylogenetic tree is a tree like diagram showing the evolutionary relationship among various species based on their differences or similarity in their physical or… (more)

Subjects/Keywords: Alignment-free; Suffix Trees; Phylogenetics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krishnan, A. (2015). Phylogenetic Tree Construction for Starfish and Primate Genomes via Alignment Free Methods. (Masters Thesis). Louisiana State University. Retrieved from etd-05272015-141735 ; https://digitalcommons.lsu.edu/gradschool_theses/1087

Chicago Manual of Style (16th Edition):

Krishnan, Ambujam. “Phylogenetic Tree Construction for Starfish and Primate Genomes via Alignment Free Methods.” 2015. Masters Thesis, Louisiana State University. Accessed October 21, 2019. etd-05272015-141735 ; https://digitalcommons.lsu.edu/gradschool_theses/1087.

MLA Handbook (7th Edition):

Krishnan, Ambujam. “Phylogenetic Tree Construction for Starfish and Primate Genomes via Alignment Free Methods.” 2015. Web. 21 Oct 2019.

Vancouver:

Krishnan A. Phylogenetic Tree Construction for Starfish and Primate Genomes via Alignment Free Methods. [Internet] [Masters thesis]. Louisiana State University; 2015. [cited 2019 Oct 21]. Available from: etd-05272015-141735 ; https://digitalcommons.lsu.edu/gradschool_theses/1087.

Council of Science Editors:

Krishnan A. Phylogenetic Tree Construction for Starfish and Primate Genomes via Alignment Free Methods. [Masters Thesis]. Louisiana State University; 2015. Available from: etd-05272015-141735 ; https://digitalcommons.lsu.edu/gradschool_theses/1087


Leiden University

18. Rijnenberg, Anne-Marie. Von abenteuern bis zwitschern: Die Form und Bedeutung von deutschen Verben auf <er>.

Degree: 2018, Leiden University

 In this thesis I examine the form and meaning of German verbs ending in -ern. This verbal suffix is not productive and not much has… (more)

Subjects/Keywords: German; Suffix; Semantics; Aktionsart; Verbs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rijnenberg, A. (2018). Von abenteuern bis zwitschern: Die Form und Bedeutung von deutschen Verben auf <er>. (Masters Thesis). Leiden University. Retrieved from http://hdl.handle.net/1887/64282

Chicago Manual of Style (16th Edition):

Rijnenberg, Anne-Marie. “Von abenteuern bis zwitschern: Die Form und Bedeutung von deutschen Verben auf <er>.” 2018. Masters Thesis, Leiden University. Accessed October 21, 2019. http://hdl.handle.net/1887/64282.

MLA Handbook (7th Edition):

Rijnenberg, Anne-Marie. “Von abenteuern bis zwitschern: Die Form und Bedeutung von deutschen Verben auf <er>.” 2018. Web. 21 Oct 2019.

Vancouver:

Rijnenberg A. Von abenteuern bis zwitschern: Die Form und Bedeutung von deutschen Verben auf <er>. [Internet] [Masters thesis]. Leiden University; 2018. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/1887/64282.

Council of Science Editors:

Rijnenberg A. Von abenteuern bis zwitschern: Die Form und Bedeutung von deutschen Verben auf <er>. [Masters Thesis]. Leiden University; 2018. Available from: http://hdl.handle.net/1887/64282


University of Guelph

19. Wickland, David D. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .

Degree: 2017, University of Guelph

 The music industry was the first mass-media industry to be transformed by the transition to digital. Today, music consumers have access to personal libraries, subscription-based… (more)

Subjects/Keywords: symbolic similarity; melodic similarity; local alignment; global alignment; music similarity; suffix tree; cover song; longest common substring; pattern matching; sequence alignment; pairwise; exact matching; inexact matching; approximate matching; string matching; music information retrieval; MIR

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wickland, D. D. (2017). Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608

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

Wickland, David D. “Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .” 2017. Thesis, University of Guelph. Accessed October 21, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608.

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

MLA Handbook (7th Edition):

Wickland, David D. “Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .” 2017. Web. 21 Oct 2019.

Vancouver:

Wickland DD. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . [Internet] [Thesis]. University of Guelph; 2017. [cited 2019 Oct 21]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608.

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

Council of Science Editors:

Wickland DD. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . [Thesis]. University of Guelph; 2017. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608

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


University of Florida

20. 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 http://ufdc.ufl.edu/UFE0051934

Chicago Manual of Style (16th Edition):

Anderson, Anna E. “Positive Deviance.” 2017. Masters Thesis, University of Florida. Accessed October 21, 2019. http://ufdc.ufl.edu/UFE0051934.

MLA Handbook (7th Edition):

Anderson, Anna E. “Positive Deviance.” 2017. Web. 21 Oct 2019.

Vancouver:

Anderson AE. Positive Deviance. [Internet] [Masters thesis]. University of Florida; 2017. [cited 2019 Oct 21]. Available from: http://ufdc.ufl.edu/UFE0051934.

Council of Science Editors:

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


Universidade Nova

21. Juozenaite, Ineta. Application of machine learning techniques for solving real world business problems : the case study - target marketing of insurance policies.

Degree: 2018, Universidade Nova

 The concept of machine learning has been around for decades, but now it is becoming more and more popular not only in the business, but… (more)

Subjects/Keywords: Machine Learning; Logistic Regression; Decision Tree CART; Artificial Neural Network; Multilayer; Percptron; Backpropagation learning algorithm; Support Vector Machine; Kernel Gaussian

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Juozenaite, I. (2018). Application of machine learning techniques for solving real world business problems : the case study - target marketing of insurance policies. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/32410

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

Juozenaite, Ineta. “Application of machine learning techniques for solving real world business problems : the case study - target marketing of insurance policies.” 2018. Thesis, Universidade Nova. Accessed October 21, 2019. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/32410.

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

MLA Handbook (7th Edition):

Juozenaite, Ineta. “Application of machine learning techniques for solving real world business problems : the case study - target marketing of insurance policies.” 2018. Web. 21 Oct 2019.

Vancouver:

Juozenaite I. Application of machine learning techniques for solving real world business problems : the case study - target marketing of insurance policies. [Internet] [Thesis]. Universidade Nova; 2018. [cited 2019 Oct 21]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/32410.

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

Council of Science Editors:

Juozenaite I. Application of machine learning techniques for solving real world business problems : the case study - target marketing of insurance policies. [Thesis]. Universidade Nova; 2018. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/32410

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

22. Waszczuk, Jakub. Leveraging MWEs in practical TAG parsing : towards the best of the two worlds : Optimisation d'analyse syntaxique basée sur les grammaires d'arbres adjoints grâce à la modélisation d'expression polylexicales et à l'algorithme A.

Degree: Docteur es, Informatique, 2017, Université François-Rabelais de Tours

Dans ce mémoire, nous nous penchons sur les expressions polylexicales (EP) et leurs relations avec l’analyse syntaxique, la tâche qui consiste à déterminer les relations… (more)

Subjects/Keywords: Expressions polytexicales; Analyse syntaxique; Grammaires d’arbres adjoints; Algorithme A*; Multiwords expression; Syntactic parsing; Tree adjoining grammars; Algorithm A*

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Waszczuk, J. (2017). Leveraging MWEs in practical TAG parsing : towards the best of the two worlds : Optimisation d'analyse syntaxique basée sur les grammaires d'arbres adjoints grâce à la modélisation d'expression polylexicales et à l'algorithme A. (Doctoral Dissertation). Université François-Rabelais de Tours. Retrieved from http://www.theses.fr/2017TOUR4024

Chicago Manual of Style (16th Edition):

Waszczuk, Jakub. “Leveraging MWEs in practical TAG parsing : towards the best of the two worlds : Optimisation d'analyse syntaxique basée sur les grammaires d'arbres adjoints grâce à la modélisation d'expression polylexicales et à l'algorithme A.” 2017. Doctoral Dissertation, Université François-Rabelais de Tours. Accessed October 21, 2019. http://www.theses.fr/2017TOUR4024.

MLA Handbook (7th Edition):

Waszczuk, Jakub. “Leveraging MWEs in practical TAG parsing : towards the best of the two worlds : Optimisation d'analyse syntaxique basée sur les grammaires d'arbres adjoints grâce à la modélisation d'expression polylexicales et à l'algorithme A.” 2017. Web. 21 Oct 2019.

Vancouver:

Waszczuk J. Leveraging MWEs in practical TAG parsing : towards the best of the two worlds : Optimisation d'analyse syntaxique basée sur les grammaires d'arbres adjoints grâce à la modélisation d'expression polylexicales et à l'algorithme A. [Internet] [Doctoral dissertation]. Université François-Rabelais de Tours; 2017. [cited 2019 Oct 21]. Available from: http://www.theses.fr/2017TOUR4024.

Council of Science Editors:

Waszczuk J. Leveraging MWEs in practical TAG parsing : towards the best of the two worlds : Optimisation d'analyse syntaxique basée sur les grammaires d'arbres adjoints grâce à la modélisation d'expression polylexicales et à l'algorithme A. [Doctoral Dissertation]. Université François-Rabelais de Tours; 2017. Available from: http://www.theses.fr/2017TOUR4024


University of Newcastle

23. Abu Zaher, Amer. A new feature selection approach based on proximity graphs and evolutionary computation.

Degree: PhD, 2017, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

Feature selection is an important step for generating new knowledge from datasets that originate from high-throughput biotechnologies. The… (more)

Subjects/Keywords: feature selection; evolutionary algorithm; proximity graph; minimum spanning tree; k-nearest neighbours graph; relative neighbourhood graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abu Zaher, A. (2017). A new feature selection approach based on proximity graphs and evolutionary computation. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1349840

Chicago Manual of Style (16th Edition):

Abu Zaher, Amer. “A new feature selection approach based on proximity graphs and evolutionary computation.” 2017. Doctoral Dissertation, University of Newcastle. Accessed October 21, 2019. http://hdl.handle.net/1959.13/1349840.

MLA Handbook (7th Edition):

Abu Zaher, Amer. “A new feature selection approach based on proximity graphs and evolutionary computation.” 2017. Web. 21 Oct 2019.

Vancouver:

Abu Zaher A. A new feature selection approach based on proximity graphs and evolutionary computation. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/1959.13/1349840.

Council of Science Editors:

Abu Zaher A. A new feature selection approach based on proximity graphs and evolutionary computation. [Doctoral Dissertation]. University of Newcastle; 2017. Available from: http://hdl.handle.net/1959.13/1349840

24. Maeng, Junghwan. Dao as a verbal suffix in Chinese verbs.

Degree: MA, East Asian Studies, 2016, University of Illinois – Urbana-Champaign

 This thesis focuses on the resultative ending dao as a suffix to Chinese verbs. Although dao is commonly understood as a mono-morphemic verb, a preposition… (more)

Subjects/Keywords: dao; suffix

…on dao as a verbal suffix, which has long been understood as a bound root or a preposition… …contemporary Chinese. As the first step to discuss dao as a verbal suffix, the paper starts with the… …It has been discussed on the theoretical basis how dao is more suffix-like compared to jian… …be treated as a suffix comparing their productivity in the corpus data. For the analysis… …convincing evidence that dao is more likely to behave as a suffix compare to jian. 2.3.5… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maeng, J. (2016). Dao as a verbal suffix in Chinese verbs. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/90679

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

Maeng, Junghwan. “Dao as a verbal suffix in Chinese verbs.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed October 21, 2019. http://hdl.handle.net/2142/90679.

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

MLA Handbook (7th Edition):

Maeng, Junghwan. “Dao as a verbal suffix in Chinese verbs.” 2016. Web. 21 Oct 2019.

Vancouver:

Maeng J. Dao as a verbal suffix in Chinese verbs. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/2142/90679.

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

Council of Science Editors:

Maeng J. Dao as a verbal suffix in Chinese verbs. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/90679

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


Wake Forest University

25. Taylor, Tyiste Braché. Judgment Day: Big Data as the Big Decider.

Degree: 2018, Wake Forest University

 This Digital Age has borne witness to not only an influx of information but also the need to make use of this information. The rapid… (more)

Subjects/Keywords: algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Taylor, T. B. (2018). Judgment Day: Big Data as the Big Decider. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/90746

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

Taylor, Tyiste Braché. “Judgment Day: Big Data as the Big Decider.” 2018. Thesis, Wake Forest University. Accessed October 21, 2019. http://hdl.handle.net/10339/90746.

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

MLA Handbook (7th Edition):

Taylor, Tyiste Braché. “Judgment Day: Big Data as the Big Decider.” 2018. Web. 21 Oct 2019.

Vancouver:

Taylor TB. Judgment Day: Big Data as the Big Decider. [Internet] [Thesis]. Wake Forest University; 2018. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/10339/90746.

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

Council of Science Editors:

Taylor TB. Judgment Day: Big Data as the Big Decider. [Thesis]. Wake Forest University; 2018. Available from: http://hdl.handle.net/10339/90746

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


Pontifical Catholic University of Rio de Janeiro

26. EVELIN CARVALHO FREIRE DE AMORIM. [en] NCE: AN ALGORITHM FOR CONTENT EXTRACTION IN NEWS PAGES.

Degree: 2017, Pontifical Catholic University of Rio de Janeiro

[pt] A extração de entidades de páginas web é comumente utilizada para melhorar a qualidade de muitas tarefas realizadas por máquinas de busca como detecção… (more)

Subjects/Keywords: [pt] WEB; [en] WEB; [pt] ALGORITMO; [en] ALGORITHM; [pt] ARVORE; [en] TREE; [pt] MAQUINAS DE BUSCA; [en] SEARCH ENGINES; [pt] EXTRACAO; [en] EXTRACTION

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

AMORIM, E. C. F. D. (2017). [en] NCE: AN ALGORITHM FOR CONTENT EXTRACTION IN NEWS PAGES. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31449

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

AMORIM, EVELIN CARVALHO FREIRE DE. “[en] NCE: AN ALGORITHM FOR CONTENT EXTRACTION IN NEWS PAGES.” 2017. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 21, 2019. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31449.

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

MLA Handbook (7th Edition):

AMORIM, EVELIN CARVALHO FREIRE DE. “[en] NCE: AN ALGORITHM FOR CONTENT EXTRACTION IN NEWS PAGES.” 2017. Web. 21 Oct 2019.

Vancouver:

AMORIM ECFD. [en] NCE: AN ALGORITHM FOR CONTENT EXTRACTION IN NEWS PAGES. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. [cited 2019 Oct 21]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31449.

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

Council of Science Editors:

AMORIM ECFD. [en] NCE: AN ALGORITHM FOR CONTENT EXTRACTION IN NEWS PAGES. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2017. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=31449

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

27. Zhao, Jinhua. Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra : Le problème de l’arbre enraciné borné maximum : algorithmes et polyèdres.

Degree: Docteur es, Informatique, 2017, Clermont Auvergne

 Étant donnés un graphe simple non orienté G = (V, E) et un sommet particulier r dans V appelé racine, un arbre enraciné, ou r-arbre,… (more)

Subjects/Keywords: Optimisation combinatoire; Arbre enraciné borné; Algorithme; Étude polyédrique; Algorithme de coupe; Combinatorial optimization; Bounded rooted-tree; Algorithm; Polyhedral study; Branch-and-cut

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, J. (2017). Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra : Le problème de l’arbre enraciné borné maximum : algorithmes et polyèdres. (Doctoral Dissertation). Clermont Auvergne. Retrieved from http://www.theses.fr/2017CLFAC044

Chicago Manual of Style (16th Edition):

Zhao, Jinhua. “Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra : Le problème de l’arbre enraciné borné maximum : algorithmes et polyèdres.” 2017. Doctoral Dissertation, Clermont Auvergne. Accessed October 21, 2019. http://www.theses.fr/2017CLFAC044.

MLA Handbook (7th Edition):

Zhao, Jinhua. “Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra : Le problème de l’arbre enraciné borné maximum : algorithmes et polyèdres.” 2017. Web. 21 Oct 2019.

Vancouver:

Zhao J. Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra : Le problème de l’arbre enraciné borné maximum : algorithmes et polyèdres. [Internet] [Doctoral dissertation]. Clermont Auvergne; 2017. [cited 2019 Oct 21]. Available from: http://www.theses.fr/2017CLFAC044.

Council of Science Editors:

Zhao J. Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra : Le problème de l’arbre enraciné borné maximum : algorithmes et polyèdres. [Doctoral Dissertation]. Clermont Auvergne; 2017. Available from: http://www.theses.fr/2017CLFAC044

28. Berk, Peter. DOLOČANJE ODMERKA FITOFARMACEVTSKEGA SREDSTVA Z UPORABO MEHKEGA ODLOČITVENEGA MODELA.

Degree: 2018, Univerza v Mariboru

Pri procesu nanašanja fitofarmacevtskega sredstva, pomešanega z vodo (škropilna brozga) v predpisani koncentraciji, s klasičnimi pršilniki za kemično varstvo krošenj dreves v sadovnjaku se uporabljajo… (more)

Subjects/Keywords: fitofarmacevtsko sredstvo; merjenje; krmiljenje; algoritem; krošnja drevesa; plant protection product; measurement; controlling; algorithm; tree canopy; info:eu-repo/classification/udc/004.942.021:632.982.1(043.3)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berk, P. (2018). DOLOČANJE ODMERKA FITOFARMACEVTSKEGA SREDSTVA Z UPORABO MEHKEGA ODLOČITVENEGA MODELA. (Doctoral Dissertation). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=70180 ; https://dk.um.si/Dokument.php?id=126748&dn= ; https://plus.si.cobiss.net/opac7/bib/297309696?lang=sl

Chicago Manual of Style (16th Edition):

Berk, Peter. “DOLOČANJE ODMERKA FITOFARMACEVTSKEGA SREDSTVA Z UPORABO MEHKEGA ODLOČITVENEGA MODELA.” 2018. Doctoral Dissertation, Univerza v Mariboru. Accessed October 21, 2019. https://dk.um.si/IzpisGradiva.php?id=70180 ; https://dk.um.si/Dokument.php?id=126748&dn= ; https://plus.si.cobiss.net/opac7/bib/297309696?lang=sl.

MLA Handbook (7th Edition):

Berk, Peter. “DOLOČANJE ODMERKA FITOFARMACEVTSKEGA SREDSTVA Z UPORABO MEHKEGA ODLOČITVENEGA MODELA.” 2018. Web. 21 Oct 2019.

Vancouver:

Berk P. DOLOČANJE ODMERKA FITOFARMACEVTSKEGA SREDSTVA Z UPORABO MEHKEGA ODLOČITVENEGA MODELA. [Internet] [Doctoral dissertation]. Univerza v Mariboru; 2018. [cited 2019 Oct 21]. Available from: https://dk.um.si/IzpisGradiva.php?id=70180 ; https://dk.um.si/Dokument.php?id=126748&dn= ; https://plus.si.cobiss.net/opac7/bib/297309696?lang=sl.

Council of Science Editors:

Berk P. DOLOČANJE ODMERKA FITOFARMACEVTSKEGA SREDSTVA Z UPORABO MEHKEGA ODLOČITVENEGA MODELA. [Doctoral Dissertation]. Univerza v Mariboru; 2018. Available from: https://dk.um.si/IzpisGradiva.php?id=70180 ; https://dk.um.si/Dokument.php?id=126748&dn= ; https://plus.si.cobiss.net/opac7/bib/297309696?lang=sl


Texas A&M University

29. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

 In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,… (more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

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

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed October 21, 2019. http://hdl.handle.net/1969.1/155568.

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

MLA Handbook (7th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 21 Oct 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/1969.1/155568.

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

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

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


Brno University of Technology

30. Foukal, Tomáš. Demonstrace indexačního algoritmu kD strom a jeho derivátů .

Degree: 2016, Brno University of Technology

 Tato práce se zabývá rozborem, návrhem a implementací aplikace pro výuku indexačního algoritmu k-D Strom a jeho derivátů. Dále se zabývá testováním aplikace, popisem jejího… (more)

Subjects/Keywords: indexovací algoritmus; k-D Strom; adaptivní k-D Strom; quadtree; demonstrace; Javascript; CSS; HTML5; podpora výuky; Selenium; indexing algorithm; kD Tree; adaptive kD Tree; quadtree; demonstration; JavaScript; CSS; HTML5; support of education; Selenium

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foukal, T. (2016). Demonstrace indexačního algoritmu kD strom a jeho derivátů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/62096

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

Foukal, Tomáš. “Demonstrace indexačního algoritmu kD strom a jeho derivátů .” 2016. Thesis, Brno University of Technology. Accessed October 21, 2019. http://hdl.handle.net/11012/62096.

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

MLA Handbook (7th Edition):

Foukal, Tomáš. “Demonstrace indexačního algoritmu kD strom a jeho derivátů .” 2016. Web. 21 Oct 2019.

Vancouver:

Foukal T. Demonstrace indexačního algoritmu kD strom a jeho derivátů . [Internet] [Thesis]. Brno University of Technology; 2016. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/11012/62096.

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

Council of Science Editors:

Foukal T. Demonstrace indexačního algoritmu kD strom a jeho derivátů . [Thesis]. Brno University of Technology; 2016. Available from: http://hdl.handle.net/11012/62096

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

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

.