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: 2005 – 2009

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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Carelo, Caio Cesar Mori. Perseus:uma nova técnica para tratar árvores de sufixo persistentes.

Degree: Mestrado, Ciências de Computação e Matemática Computacional, 2009, University of São Paulo

O avanço tecnológico dos laboratórios de biologia molecular tem proporcionado um grande aumento no volume de seqüências de nucleotídeos armazenadas em bancos de dados biológicos,… (more)

Subjects/Keywords: Árvore de sufixo; Bioinformática; Bioinformatics; Nucleotides sequence; Seqüencia de nucleotídeos; Suffix tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carelo, C. C. M. (2009). Perseus:uma nova técnica para tratar árvores de sufixo persistentes. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;

Chicago Manual of Style (16th Edition):

Carelo, Caio Cesar Mori. “Perseus:uma nova técnica para tratar árvores de sufixo persistentes.” 2009. Masters Thesis, University of São Paulo. Accessed October 17, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;.

MLA Handbook (7th Edition):

Carelo, Caio Cesar Mori. “Perseus:uma nova técnica para tratar árvores de sufixo persistentes.” 2009. Web. 17 Oct 2019.

Vancouver:

Carelo CCM. Perseus:uma nova técnica para tratar árvores de sufixo persistentes. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2019 Oct 17]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;.

Council of Science Editors:

Carelo CCM. Perseus:uma nova técnica para tratar árvores de sufixo persistentes. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;

2. WONG SWEE SEONG. String matching and indexing with suffix data structures.

Degree: 2008, National University of Singapore

Subjects/Keywords: suffix tree; suffix array; compressed suffix data structures; string indexing; string matching; sequence alignment search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SEONG, W. S. (2008). String matching and indexing with suffix data structures. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13083

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

SEONG, WONG SWEE. “String matching and indexing with suffix data structures.” 2008. Thesis, National University of Singapore. Accessed October 17, 2019. http://scholarbank.nus.edu.sg/handle/10635/13083.

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

MLA Handbook (7th Edition):

SEONG, WONG SWEE. “String matching and indexing with suffix data structures.” 2008. Web. 17 Oct 2019.

Vancouver:

SEONG WS. String matching and indexing with suffix data structures. [Internet] [Thesis]. National University of Singapore; 2008. [cited 2019 Oct 17]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13083.

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

Council of Science Editors:

SEONG WS. String matching and indexing with suffix data structures. [Thesis]. National University of Singapore; 2008. Available from: http://scholarbank.nus.edu.sg/handle/10635/13083

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

3. Soares Neto, Domingos. Filtros para a busca e extração de padrões aproximados em cadeias biológicas.

Degree: Mestrado, Ciência da Computação, 2008, University of São Paulo

Esta dissertação de mestrado aborda formulações computacionais e algoritmos para a busca e extração de padrões em cadeias biológicas. Em particular, o presente texto concentra-se… (more)

Subjects/Keywords: algoritmos bit-paralelos; algoritmos de filtragem; approximate string matching; árvores dos sufixos; bit-parallel algorithms; busca aproximada de padrões; extração de padrões; filter algorithms; motifs; motifs; patterns extraction; q-gramas; q-grams; suffix array; suffix tree; vetor dos sufixos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soares Neto, D. (2008). Filtros para a busca e extração de padrões aproximados em cadeias biológicas. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;

Chicago Manual of Style (16th Edition):

Soares Neto, Domingos. “Filtros para a busca e extração de padrões aproximados em cadeias biológicas.” 2008. Masters Thesis, University of São Paulo. Accessed October 17, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;.

MLA Handbook (7th Edition):

Soares Neto, Domingos. “Filtros para a busca e extração de padrões aproximados em cadeias biológicas.” 2008. Web. 17 Oct 2019.

Vancouver:

Soares Neto D. Filtros para a busca e extração de padrões aproximados em cadeias biológicas. [Internet] [Masters thesis]. University of São Paulo; 2008. [cited 2019 Oct 17]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;.

Council of Science Editors:

Soares Neto D. Filtros para a busca e extração de padrões aproximados em cadeias biológicas. [Masters Thesis]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;


Brno University of Technology

4. Angelov, Michael. Hudební improvizace .

Degree: 2009, Brno University of Technology

 Bakalářská práce sa zabývá problematikou algoritmické kompozice hudby, zejména oblastí počítačem řízené hudební improvizace. V úvodních kapitolách je uveden přehled existujícich nástrojů a přístupů nejčastěji… (more)

Subjects/Keywords: MIDI; improvizace; algoritmická kompozice hudby; počítačová hudba; prediction suffix tree; PST; markovské řetězce; MIDI; improvisation; algorithmic music composition; computer music; prediction suffix tree; PST; markov chains

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angelov, M. (2009). Hudební improvizace . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54559

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

Angelov, Michael. “Hudební improvizace .” 2009. Thesis, Brno University of Technology. Accessed October 17, 2019. http://hdl.handle.net/11012/54559.

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

MLA Handbook (7th Edition):

Angelov, Michael. “Hudební improvizace .” 2009. Web. 17 Oct 2019.

Vancouver:

Angelov M. Hudební improvizace . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/11012/54559.

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

Council of Science Editors:

Angelov M. Hudební improvizace . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/54559

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


Louisiana State University

5. 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 October 17, 2019. 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. 17 Oct 2019.

Vancouver:

Ding S. Optimal binary trees with height restrictions on left and right branches. [Internet] [Masters thesis]. Louisiana State University; 2006. [cited 2019 Oct 17]. 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


NSYSU

6. Chen, Kuan-Mei. Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception.

Degree: PhD, Computer Science and Engineering, 2009, NSYSU

 In this dissertation, we propose using and analytically evaluate the predictive multicast polling scheme and the tree splitting algorithm for medium access control in interference… (more)

Subjects/Keywords: Wireless LAN; Tree/Stack Splitting Algorithm; Probabilistic Performance Analysis; Multipacket Reception; Medium Access Control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, K. (2009). Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341

Chicago Manual of Style (16th Edition):

Chen, Kuan-Mei. “Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception.” 2009. Doctoral Dissertation, NSYSU. Accessed October 17, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341.

MLA Handbook (7th Edition):

Chen, Kuan-Mei. “Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception.” 2009. Web. 17 Oct 2019.

Vancouver:

Chen K. Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception. [Internet] [Doctoral dissertation]. NSYSU; 2009. [cited 2019 Oct 17]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341.

Council of Science Editors:

Chen K. Predictive Multicast Polling and Tree Splitting Algorithm in Wireless Access Networks with Multipacket Reception. [Doctoral Dissertation]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823109-140341


Miami University

7. Dai, Yan. A NEW IMPLEMENTATION OF CLUSTERING ALGORITHM AND ITS APPLICATION IN NET-TREE CONSTRUCTION ALGORITHM.

Degree: Master of Computer Science, Computer Science and Systems Analysis, 2009, Miami University

 In a vertex k-center problem, the goal is to pick some vertexes, called centers, from a given undirected weighted graph so as to minimize the… (more)

Subjects/Keywords: Computer Science; clustering; k-center; net-tree; geometric algorithm; doubling dimension; doubling constant

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dai, Y. (2009). A NEW IMPLEMENTATION OF CLUSTERING ALGORITHM AND ITS APPLICATION IN NET-TREE CONSTRUCTION ALGORITHM. (Masters Thesis). Miami University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=miami1237496109

Chicago Manual of Style (16th Edition):

Dai, Yan. “A NEW IMPLEMENTATION OF CLUSTERING ALGORITHM AND ITS APPLICATION IN NET-TREE CONSTRUCTION ALGORITHM.” 2009. Masters Thesis, Miami University. Accessed October 17, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=miami1237496109.

MLA Handbook (7th Edition):

Dai, Yan. “A NEW IMPLEMENTATION OF CLUSTERING ALGORITHM AND ITS APPLICATION IN NET-TREE CONSTRUCTION ALGORITHM.” 2009. Web. 17 Oct 2019.

Vancouver:

Dai Y. A NEW IMPLEMENTATION OF CLUSTERING ALGORITHM AND ITS APPLICATION IN NET-TREE CONSTRUCTION ALGORITHM. [Internet] [Masters thesis]. Miami University; 2009. [cited 2019 Oct 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1237496109.

Council of Science Editors:

Dai Y. A NEW IMPLEMENTATION OF CLUSTERING ALGORITHM AND ITS APPLICATION IN NET-TREE CONSTRUCTION ALGORITHM. [Masters Thesis]. Miami University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=miami1237496109


Ohio University

8. Hari, Vijaya. Empirical Investigation of CART and Decision Tree Extraction from Neural Networks.

Degree: MS, Industrial and Systems Engineering (Engineering and Technology), 2009, Ohio University

 Accuracy is a critical factor in predictive modeling. A predictive model such as a decision tree must be accurate to draw conclusions about a prediction.… (more)

Subjects/Keywords: Industrial Engineering; Classification and Regression Trees; TREPAN; Enhanced CART; Decision Tree Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hari, V. (2009). Empirical Investigation of CART and Decision Tree Extraction from Neural Networks. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1235676338

Chicago Manual of Style (16th Edition):

Hari, Vijaya. “Empirical Investigation of CART and Decision Tree Extraction from Neural Networks.” 2009. Masters Thesis, Ohio University. Accessed October 17, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1235676338.

MLA Handbook (7th Edition):

Hari, Vijaya. “Empirical Investigation of CART and Decision Tree Extraction from Neural Networks.” 2009. Web. 17 Oct 2019.

Vancouver:

Hari V. Empirical Investigation of CART and Decision Tree Extraction from Neural Networks. [Internet] [Masters thesis]. Ohio University; 2009. [cited 2019 Oct 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1235676338.

Council of Science Editors:

Hari V. Empirical Investigation of CART and Decision Tree Extraction from Neural Networks. [Masters Thesis]. Ohio University; 2009. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1235676338


University of Waterloo

9. He, Meng. Succinct Indexes.

Degree: 2008, University of Waterloo

 This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically… (more)

Subjects/Keywords: succinct data structures; data structures; string; binary relation; text index; suffix array; tree; graph; succinct index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, M. (2008). Succinct Indexes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3583

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

He, Meng. “Succinct Indexes.” 2008. Thesis, University of Waterloo. Accessed October 17, 2019. http://hdl.handle.net/10012/3583.

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

MLA Handbook (7th Edition):

He, Meng. “Succinct Indexes.” 2008. Web. 17 Oct 2019.

Vancouver:

He M. Succinct Indexes. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10012/3583.

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

Council of Science Editors:

He M. Succinct Indexes. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3583

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


Vilnius Gediminas Technical University

10. Ivanauskaitė, Ilma. Mokslinio žurnalo tinklalapio kūrimas.

Degree: Master, Informatics, 2009, Vilnius Gediminas Technical University

Baigiamajame magistro darbe nagrinėjamas mokslinio žurnalo tinklalapio kūrimas. Atliktas kuriamo tinklalapio palyginimas su kitų universitetų ar institutų mokslinių žurnalų tinklalapiais. Taip pat atliktas palyginimas ir… (more)

Subjects/Keywords: MySQL; Indeksas; B medis; Turbo Boyer-Moore algoritmas; MySQL; Index; B tree; Turbo Boyer-Moore algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ivanauskaitė, Ilma. (2009). Mokslinio žurnalo tinklalapio kūrimas. (Masters Thesis). Vilnius Gediminas Technical University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20090618_182844-59741 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Ivanauskaitė, Ilma. “Mokslinio žurnalo tinklalapio kūrimas.” 2009. Masters Thesis, Vilnius Gediminas Technical University. Accessed October 17, 2019. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20090618_182844-59741 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Ivanauskaitė, Ilma. “Mokslinio žurnalo tinklalapio kūrimas.” 2009. Web. 17 Oct 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Ivanauskaitė, Ilma. Mokslinio žurnalo tinklalapio kūrimas. [Internet] [Masters thesis]. Vilnius Gediminas Technical University; 2009. [cited 2019 Oct 17]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20090618_182844-59741 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Ivanauskaitė, Ilma. Mokslinio žurnalo tinklalapio kūrimas. [Masters Thesis]. Vilnius Gediminas Technical University; 2009. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2009~D_20090618_182844-59741 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


Georgia State University

11. Thankachan, Shibi. 64 x 64 Bit Multiplier Using Pass Logic.

Degree: MS, Computer Science, 2006, Georgia State University

 ABSTRACT Due to the rapid progress in the field of VLSI, improvements in speed, power and area are quite evident. Research and development in this… (more)

Subjects/Keywords: Multiplier; Algorithm; Wallace Tree; Adder; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thankachan, S. (2006). 64 x 64 Bit Multiplier Using Pass Logic. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_theses/31

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

Thankachan, Shibi. “64 x 64 Bit Multiplier Using Pass Logic.” 2006. Thesis, Georgia State University. Accessed October 17, 2019. https://scholarworks.gsu.edu/cs_theses/31.

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

MLA Handbook (7th Edition):

Thankachan, Shibi. “64 x 64 Bit Multiplier Using Pass Logic.” 2006. Web. 17 Oct 2019.

Vancouver:

Thankachan S. 64 x 64 Bit Multiplier Using Pass Logic. [Internet] [Thesis]. Georgia State University; 2006. [cited 2019 Oct 17]. Available from: https://scholarworks.gsu.edu/cs_theses/31.

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

Council of Science Editors:

Thankachan S. 64 x 64 Bit Multiplier Using Pass Logic. [Thesis]. Georgia State University; 2006. Available from: https://scholarworks.gsu.edu/cs_theses/31

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


Louisiana State University

12. Venkat Rao, Dinesh Prasad. Designing switches for routing in circuit-switched trees.

Degree: MSEE, Electrical and Computer Engineering, 2005, Louisiana State University

 Reconfigurable computing provides a fast and flexible solution for intensive computing processes. Thus, it acts as a bridge between software controlled and hardware based processors.… (more)

Subjects/Keywords: reconfigurable switches; circuit-switched tree; configuration algorithm; reconfigurable computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Venkat Rao, D. P. (2005). Designing switches for routing in circuit-switched trees. (Masters Thesis). Louisiana State University. Retrieved from etd-01232006-212520 ; https://digitalcommons.lsu.edu/gradschool_theses/1927

Chicago Manual of Style (16th Edition):

Venkat Rao, Dinesh Prasad. “Designing switches for routing in circuit-switched trees.” 2005. Masters Thesis, Louisiana State University. Accessed October 17, 2019. etd-01232006-212520 ; https://digitalcommons.lsu.edu/gradschool_theses/1927.

MLA Handbook (7th Edition):

Venkat Rao, Dinesh Prasad. “Designing switches for routing in circuit-switched trees.” 2005. Web. 17 Oct 2019.

Vancouver:

Venkat Rao DP. Designing switches for routing in circuit-switched trees. [Internet] [Masters thesis]. Louisiana State University; 2005. [cited 2019 Oct 17]. Available from: etd-01232006-212520 ; https://digitalcommons.lsu.edu/gradschool_theses/1927.

Council of Science Editors:

Venkat Rao DP. Designing switches for routing in circuit-switched trees. [Masters Thesis]. Louisiana State University; 2005. Available from: etd-01232006-212520 ; https://digitalcommons.lsu.edu/gradschool_theses/1927


Pontifical Catholic University of Rio de Janeiro

13. EDUARDO SANY LABER. [en] PREFIX CODES: ALGORITHMS AND BOUNDS.

Degree: 2009, Pontifical Catholic University of Rio de Janeiro

[pt] Os códigos de prefixo têm importância fundamental na comprenssão e transmissão de dados. Estes códigos também apresentam relações com problemas de busca. Neste tese,… (more)

Subjects/Keywords: [pt] COMPRESSAO; [en] COMPRESSION; [pt] ALGORITMO; [en] ALGORITHM; [pt] COMPLEXIDADE COMPUTACIONAL; [en] COMPLEXITY COMPUTATIONAL; [pt] ARVORE; [en] TREE

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

LABER, E. S. (2009). [en] PREFIX CODES: ALGORITHMS AND BOUNDS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13809

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

LABER, EDUARDO SANY. “[en] PREFIX CODES: ALGORITHMS AND BOUNDS.” 2009. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed October 17, 2019. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13809.

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

MLA Handbook (7th Edition):

LABER, EDUARDO SANY. “[en] PREFIX CODES: ALGORITHMS AND BOUNDS.” 2009. Web. 17 Oct 2019.

Vancouver:

LABER ES. [en] PREFIX CODES: ALGORITHMS AND BOUNDS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. [cited 2019 Oct 17]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13809.

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

Council of Science Editors:

LABER ES. [en] PREFIX CODES: ALGORITHMS AND BOUNDS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2009. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13809

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


Indian Institute of Science

14. Vasanta Lakshmi, Kommineni. Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework.

Degree: 2006, Indian Institute of Science

 This thesis presents a new unified algorithm for cluster assignment and acyclic region scheduling in a partitioned architecture, and preliminary results on its integration into… (more)

Subjects/Keywords: Computer Architecture; HMDES Architecture; Tree Transformer Generator; Register Allocation Algorithm; Integrated Scheduling Algorithm; TI Code; Retargetable Code Generation Framework; Target Processor; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vasanta Lakshmi, K. (2006). Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/414

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

Vasanta Lakshmi, Kommineni. “Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework.” 2006. Thesis, Indian Institute of Science. Accessed October 17, 2019. http://hdl.handle.net/2005/414.

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

MLA Handbook (7th Edition):

Vasanta Lakshmi, Kommineni. “Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework.” 2006. Web. 17 Oct 2019.

Vancouver:

Vasanta Lakshmi K. Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework. [Internet] [Thesis]. Indian Institute of Science; 2006. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/2005/414.

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

Council of Science Editors:

Vasanta Lakshmi K. Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework. [Thesis]. Indian Institute of Science; 2006. Available from: http://hdl.handle.net/2005/414

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


Virginia Tech

15. Gantovnik, Vladimir. An Improved Genetic Algorithm for the Optimization of Composite Structures.

Degree: PhD, Engineering Science and Mechanics, 2005, Virginia Tech

 There are many diverse applications that are mathematically modelled in terms of mixed discrete-continuous variables. The optimization of these models is typically difficult due to… (more)

Subjects/Keywords: binary tree memory; composite structures; multivariate approximation; genetic algorithm; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gantovnik, V. (2005). An Improved Genetic Algorithm for the Optimization of Composite Structures. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/28901

Chicago Manual of Style (16th Edition):

Gantovnik, Vladimir. “An Improved Genetic Algorithm for the Optimization of Composite Structures.” 2005. Doctoral Dissertation, Virginia Tech. Accessed October 17, 2019. http://hdl.handle.net/10919/28901.

MLA Handbook (7th Edition):

Gantovnik, Vladimir. “An Improved Genetic Algorithm for the Optimization of Composite Structures.” 2005. Web. 17 Oct 2019.

Vancouver:

Gantovnik V. An Improved Genetic Algorithm for the Optimization of Composite Structures. [Internet] [Doctoral dissertation]. Virginia Tech; 2005. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10919/28901.

Council of Science Editors:

Gantovnik V. An Improved Genetic Algorithm for the Optimization of Composite Structures. [Doctoral Dissertation]. Virginia Tech; 2005. Available from: http://hdl.handle.net/10919/28901

16. LU JIAHENG. Efficient processing of XML twig pattern matching.

Degree: 2007, National University of Singapore

Subjects/Keywords: XML; query processing; algorithm; tree pattern; semi-structure data; holistic twig join

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

JIAHENG, L. (2007). Efficient processing of XML twig pattern matching. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/15682

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

JIAHENG, LU. “Efficient processing of XML twig pattern matching.” 2007. Thesis, National University of Singapore. Accessed October 17, 2019. http://scholarbank.nus.edu.sg/handle/10635/15682.

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

MLA Handbook (7th Edition):

JIAHENG, LU. “Efficient processing of XML twig pattern matching.” 2007. Web. 17 Oct 2019.

Vancouver:

JIAHENG L. Efficient processing of XML twig pattern matching. [Internet] [Thesis]. National University of Singapore; 2007. [cited 2019 Oct 17]. Available from: http://scholarbank.nus.edu.sg/handle/10635/15682.

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

Council of Science Editors:

JIAHENG L. Efficient processing of XML twig pattern matching. [Thesis]. National University of Singapore; 2007. Available from: http://scholarbank.nus.edu.sg/handle/10635/15682

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


Rochester Institute of Technology

17. Pavlo, Andrew. Interactive, tree-based graph visualization.

Degree: Computer Science (GCCIS), 2006, Rochester Institute of Technology

 We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the… (more)

Subjects/Keywords: Algorithm; Graph animation; Graph drawing; Graph visualization; Interactive; Tree-based

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pavlo, A. (2006). Interactive, tree-based graph visualization. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/352

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

Pavlo, Andrew. “Interactive, tree-based graph visualization.” 2006. Thesis, Rochester Institute of Technology. Accessed October 17, 2019. https://scholarworks.rit.edu/theses/352.

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

MLA Handbook (7th Edition):

Pavlo, Andrew. “Interactive, tree-based graph visualization.” 2006. Web. 17 Oct 2019.

Vancouver:

Pavlo A. Interactive, tree-based graph visualization. [Internet] [Thesis]. Rochester Institute of Technology; 2006. [cited 2019 Oct 17]. Available from: https://scholarworks.rit.edu/theses/352.

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

Council of Science Editors:

Pavlo A. Interactive, tree-based graph visualization. [Thesis]. Rochester Institute of Technology; 2006. Available from: https://scholarworks.rit.edu/theses/352

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

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

Degree: 2006, Helsinki University of Technology

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Schaeffer, Satu Elisa. “Algorithms for Nonuniform Networks.” 2006. Web. 17 Oct 2019.

Vancouver:

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

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

Council of Science Editors:

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

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


University of Georgia

19. Kerr, Lindsey K. Tree preservation ordinances: smart protections for our communities' heritage trees.

Degree: MHP, Historic Preservation, 2009, University of Georgia

 The number of heritage tree preservation ordinances is growing as cities face pressure from citizens outraged by the removal of community landmark trees. This thesis… (more)

Subjects/Keywords: heritage tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kerr, L. K. (2009). Tree preservation ordinances: smart protections for our communities' heritage trees. (Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/kerr_lindsey_k_200908_mhp

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

Kerr, Lindsey K. “Tree preservation ordinances: smart protections for our communities' heritage trees.” 2009. Thesis, University of Georgia. Accessed October 17, 2019. http://purl.galileo.usg.edu/uga_etd/kerr_lindsey_k_200908_mhp.

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

MLA Handbook (7th Edition):

Kerr, Lindsey K. “Tree preservation ordinances: smart protections for our communities' heritage trees.” 2009. Web. 17 Oct 2019.

Vancouver:

Kerr LK. Tree preservation ordinances: smart protections for our communities' heritage trees. [Internet] [Thesis]. University of Georgia; 2009. [cited 2019 Oct 17]. Available from: http://purl.galileo.usg.edu/uga_etd/kerr_lindsey_k_200908_mhp.

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

Council of Science Editors:

Kerr LK. Tree preservation ordinances: smart protections for our communities' heritage trees. [Thesis]. University of Georgia; 2009. Available from: http://purl.galileo.usg.edu/uga_etd/kerr_lindsey_k_200908_mhp

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


University of Georgia

20. Yang, Hongyu. Phylogenetic tree display: a web-based visualization tool for phylogenetic data.

Degree: MS, Computer Science, 2007, University of Georgia

 Phylogenetic Tree Display is a web application and database schema for storing and interactively displaying genetic relatedness data. The web display has a unique combination… (more)

Subjects/Keywords: Phylogenetic tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, H. (2007). Phylogenetic tree display: a web-based visualization tool for phylogenetic data. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/yang_hongyu_200705_ms

Chicago Manual of Style (16th Edition):

Yang, Hongyu. “Phylogenetic tree display: a web-based visualization tool for phylogenetic data.” 2007. Masters Thesis, University of Georgia. Accessed October 17, 2019. http://purl.galileo.usg.edu/uga_etd/yang_hongyu_200705_ms.

MLA Handbook (7th Edition):

Yang, Hongyu. “Phylogenetic tree display: a web-based visualization tool for phylogenetic data.” 2007. Web. 17 Oct 2019.

Vancouver:

Yang H. Phylogenetic tree display: a web-based visualization tool for phylogenetic data. [Internet] [Masters thesis]. University of Georgia; 2007. [cited 2019 Oct 17]. Available from: http://purl.galileo.usg.edu/uga_etd/yang_hongyu_200705_ms.

Council of Science Editors:

Yang H. Phylogenetic tree display: a web-based visualization tool for phylogenetic data. [Masters Thesis]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/yang_hongyu_200705_ms


Brno University of Technology

21. Stráník, František. Teorie grafů - implementace vybraných problémů .

Degree: 2009, Brno University of Technology

 Tato práce je zaměřena na seznámení se základními problémy z oblasti teorie grafů. Jsou zde popsány základní pojmy i složitější problémy. Jedna část práce je… (more)

Subjects/Keywords: teorie grafů; vyhledávací strom; BFS; DFS; Dijkstrův algoritmus; Floyd-Warshallův algoritmus; Bellman-Fordův algoritmus; Kruskalův algoritmus; Jarníkův algoritmus; Borůvkův algoritmus; graphs theory; search tree; BFS; DFS; Dijkstra´s algorithm; Floyd-Warshall´s algorithm; Bellman-Ford´s algorithm; Kruskal´s algorithm; Jarnik´s algorithm; Boruvka´s algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stráník, F. (2009). Teorie grafů - implementace vybraných problémů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/10188

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

Stráník, František. “Teorie grafů - implementace vybraných problémů .” 2009. Thesis, Brno University of Technology. Accessed October 17, 2019. http://hdl.handle.net/11012/10188.

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

MLA Handbook (7th Edition):

Stráník, František. “Teorie grafů - implementace vybraných problémů .” 2009. Web. 17 Oct 2019.

Vancouver:

Stráník F. Teorie grafů - implementace vybraných problémů . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/11012/10188.

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

Council of Science Editors:

Stráník F. Teorie grafů - implementace vybraných problémů . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/10188

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


University of Canterbury

22. Steel, M. Refining Phylogenetic Trees Given Additional Data: Algorithms Based on Parsimony.

Degree: Mathematics and Statistics, 2009, University of Canterbury

 Given a set X of taxa, a phylogenetic X-tree T that is only partially resolved, and a collection of characters on X, we consider the… (more)

Subjects/Keywords: Maximum parsimony; Fitch-Hartigan algorithm; optimal tree refinement; hitting set problem; fixed parameter tractability; Fields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematics; Fields of Research::280000 Information, Computing and Communication Sciences::280500 Data Format::280501 Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steel, M. (2009). Refining Phylogenetic Trees Given Additional Data: Algorithms Based on Parsimony. (Thesis). University of Canterbury. Retrieved from http://hdl.handle.net/10092/2635

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

Steel, M. “Refining Phylogenetic Trees Given Additional Data: Algorithms Based on Parsimony.” 2009. Thesis, University of Canterbury. Accessed October 17, 2019. http://hdl.handle.net/10092/2635.

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

MLA Handbook (7th Edition):

Steel, M. “Refining Phylogenetic Trees Given Additional Data: Algorithms Based on Parsimony.” 2009. Web. 17 Oct 2019.

Vancouver:

Steel M. Refining Phylogenetic Trees Given Additional Data: Algorithms Based on Parsimony. [Internet] [Thesis]. University of Canterbury; 2009. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10092/2635.

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

Council of Science Editors:

Steel M. Refining Phylogenetic Trees Given Additional Data: Algorithms Based on Parsimony. [Thesis]. University of Canterbury; 2009. Available from: http://hdl.handle.net/10092/2635

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

23. Bittermann, M.S. Intelligent Design Objects (IDO): A cognitive approach for performance-based design.

Degree: 2009, www.boekenbent.com

 Design is complex. This is because it involves conflicting goals that are often vague. Also, prior to the design it is generally not clear how… (more)

Subjects/Keywords: computational design; soft computing; computational intelligence; fuzzy neural tree; multi-objective evolutionary algorithm; design automation; cognitive systems; perception modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bittermann, M. S. (2009). Intelligent Design Objects (IDO): A cognitive approach for performance-based design. (Doctoral Dissertation). www.boekenbent.com. Retrieved from http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525

Chicago Manual of Style (16th Edition):

Bittermann, M S. “Intelligent Design Objects (IDO): A cognitive approach for performance-based design.” 2009. Doctoral Dissertation, www.boekenbent.com. Accessed October 17, 2019. http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525.

MLA Handbook (7th Edition):

Bittermann, M S. “Intelligent Design Objects (IDO): A cognitive approach for performance-based design.” 2009. Web. 17 Oct 2019.

Vancouver:

Bittermann MS. Intelligent Design Objects (IDO): A cognitive approach for performance-based design. [Internet] [Doctoral dissertation]. www.boekenbent.com; 2009. [cited 2019 Oct 17]. Available from: http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525.

Council of Science Editors:

Bittermann MS. Intelligent Design Objects (IDO): A cognitive approach for performance-based design. [Doctoral Dissertation]. www.boekenbent.com; 2009. Available from: http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; urn:NBN:nl:ui:24-uuid:785ecfa1-93e3-4186-9a48-006f7e004525 ; http://resolver.tudelft.nl/uuid:785ecfa1-93e3-4186-9a48-006f7e004525


University of Waterloo

24. Aazami, Ashkan. Hardness results and approximation algorithms for some problems on graphs.

Degree: 2008, University of Waterloo

 This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node… (more)

Subjects/Keywords: Approximation algorithm; Hardness of approximation; Power Dominating Set; Packing Steiner Tree; PTAS; Planar graphs; Integrality ratio

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aazami, A. (2008). Hardness results and approximation algorithms for some problems on graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4147

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

Aazami, Ashkan. “Hardness results and approximation algorithms for some problems on graphs.” 2008. Thesis, University of Waterloo. Accessed October 17, 2019. http://hdl.handle.net/10012/4147.

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

MLA Handbook (7th Edition):

Aazami, Ashkan. “Hardness results and approximation algorithms for some problems on graphs.” 2008. Web. 17 Oct 2019.

Vancouver:

Aazami A. Hardness results and approximation algorithms for some problems on graphs. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10012/4147.

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

Council of Science Editors:

Aazami A. Hardness results and approximation algorithms for some problems on graphs. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/4147

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

25. Μελισσαροπούλου, Δήμητρα. Η μορφολογική διαδικασία του υποκορισμού στη διαλεκτική ποικιλία της ελληνικής : σύγκριση με την ΚΝΕ.

Degree: 2006, University of Patras

 Στην παρούσα μεταπτυχιακή εργασία εξετάζεται η μορφολογική διαδικασία του υποκορισμού όπως αυτή πραγματώνεται μέσω της παραγωγικής επιθηματοποίησης στη διαλεκτική ποικιλία της ελληνικής σε σύγκριση με… (more)

Subjects/Keywords: Μορφολογία; Επίθημα; 489.359 2; Morphology; Suffix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Μελισσαροπούλου, . (2006). Η μορφολογική διαδικασία του υποκορισμού στη διαλεκτική ποικιλία της ελληνικής : σύγκριση με την ΚΝΕ. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/1054

Chicago Manual of Style (16th Edition):

Μελισσαροπούλου, Δήμητρα. “Η μορφολογική διαδικασία του υποκορισμού στη διαλεκτική ποικιλία της ελληνικής : σύγκριση με την ΚΝΕ.” 2006. Masters Thesis, University of Patras. Accessed October 17, 2019. http://nemertes.lis.upatras.gr/jspui/handle/10889/1054.

MLA Handbook (7th Edition):

Μελισσαροπούλου, Δήμητρα. “Η μορφολογική διαδικασία του υποκορισμού στη διαλεκτική ποικιλία της ελληνικής : σύγκριση με την ΚΝΕ.” 2006. Web. 17 Oct 2019.

Vancouver:

Μελισσαροπούλου . Η μορφολογική διαδικασία του υποκορισμού στη διαλεκτική ποικιλία της ελληνικής : σύγκριση με την ΚΝΕ. [Internet] [Masters thesis]. University of Patras; 2006. [cited 2019 Oct 17]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/1054.

Council of Science Editors:

Μελισσαροπούλου . Η μορφολογική διαδικασία του υποκορισμού στη διαλεκτική ποικιλία της ελληνικής : σύγκριση με την ΚΝΕ. [Masters Thesis]. University of Patras; 2006. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/1054


Universiteit Hasselt

26. NULENS, Raf. Sequentie analyse.

Degree: 2005, Universiteit Hasselt

Subjects/Keywords: Suffix trees; incrementele opbouw; TOP-Q en TDD; suffix array; Vmatch; Blast; Quasar; PSI-blast; suffix sequoia; oasis; mummer; possumsearch

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

NULENS, R. (2005). Sequentie analyse. (Thesis). Universiteit Hasselt. Retrieved from http://hdl.handle.net/1942/1095

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

NULENS, Raf. “Sequentie analyse.” 2005. Thesis, Universiteit Hasselt. Accessed October 17, 2019. http://hdl.handle.net/1942/1095.

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

MLA Handbook (7th Edition):

NULENS, Raf. “Sequentie analyse.” 2005. Web. 17 Oct 2019.

Vancouver:

NULENS R. Sequentie analyse. [Internet] [Thesis]. Universiteit Hasselt; 2005. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/1942/1095.

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

Council of Science Editors:

NULENS R. Sequentie analyse. [Thesis]. Universiteit Hasselt; 2005. Available from: http://hdl.handle.net/1942/1095

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


Duquesne University

27. Chen, Pu. Classification Tree Models for Predicting Cancer Status.

Degree: MS, Computational Mathematics, 2009, Duquesne University

 Early detection of cancers might improve the clinical outcomes. Multiple biomarkers with a novel LabMAP technology were used as the laboratory method to develop the… (more)

Subjects/Keywords: classification tree; cancer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, P. (2009). Classification Tree Models for Predicting Cancer Status. (Masters Thesis). Duquesne University. Retrieved from https://dsc.duq.edu/etd/397

Chicago Manual of Style (16th Edition):

Chen, Pu. “Classification Tree Models for Predicting Cancer Status.” 2009. Masters Thesis, Duquesne University. Accessed October 17, 2019. https://dsc.duq.edu/etd/397.

MLA Handbook (7th Edition):

Chen, Pu. “Classification Tree Models for Predicting Cancer Status.” 2009. Web. 17 Oct 2019.

Vancouver:

Chen P. Classification Tree Models for Predicting Cancer Status. [Internet] [Masters thesis]. Duquesne University; 2009. [cited 2019 Oct 17]. Available from: https://dsc.duq.edu/etd/397.

Council of Science Editors:

Chen P. Classification Tree Models for Predicting Cancer Status. [Masters Thesis]. Duquesne University; 2009. Available from: https://dsc.duq.edu/etd/397


University of Georgia

28. Johnson, Bernadette Elaine. Using the Levenshtein algorithm for automatic lemmatization in Old English.

Degree: MA, English, 2009, University of Georgia

 This study was undertaken to develop and test an automatic lemmatization program for the Old English language utilizing the Levenshtein edit distance algorithm, stemming, and… (more)

Subjects/Keywords: Levenshtein Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, B. E. (2009). Using the Levenshtein algorithm for automatic lemmatization in Old English. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma

Chicago Manual of Style (16th Edition):

Johnson, Bernadette Elaine. “Using the Levenshtein algorithm for automatic lemmatization in Old English.” 2009. Masters Thesis, University of Georgia. Accessed October 17, 2019. http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma.

MLA Handbook (7th Edition):

Johnson, Bernadette Elaine. “Using the Levenshtein algorithm for automatic lemmatization in Old English.” 2009. Web. 17 Oct 2019.

Vancouver:

Johnson BE. Using the Levenshtein algorithm for automatic lemmatization in Old English. [Internet] [Masters thesis]. University of Georgia; 2009. [cited 2019 Oct 17]. Available from: http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma.

Council of Science Editors:

Johnson BE. Using the Levenshtein algorithm for automatic lemmatization in Old English. [Masters Thesis]. University of Georgia; 2009. Available from: http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma


University of Georgia

29. Ujjwal, Kumar. Cyber haggler: web based bargaining using genetic algorithm.

Degree: MS, Artificial Intelligence, 2007, University of Georgia

 In this thesis, we analyze the sequential bargaining problem from a different perspective. Instead of taking a game theoretic approach, we model bargaining as a… (more)

Subjects/Keywords: Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ujjwal, K. (2007). Cyber haggler: web based bargaining using genetic algorithm. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms

Chicago Manual of Style (16th Edition):

Ujjwal, Kumar. “Cyber haggler: web based bargaining using genetic algorithm.” 2007. Masters Thesis, University of Georgia. Accessed October 17, 2019. http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms.

MLA Handbook (7th Edition):

Ujjwal, Kumar. “Cyber haggler: web based bargaining using genetic algorithm.” 2007. Web. 17 Oct 2019.

Vancouver:

Ujjwal K. Cyber haggler: web based bargaining using genetic algorithm. [Internet] [Masters thesis]. University of Georgia; 2007. [cited 2019 Oct 17]. Available from: http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms.

Council of Science Editors:

Ujjwal K. Cyber haggler: web based bargaining using genetic algorithm. [Masters Thesis]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms

30. Παπαδόπουλος, Χάρης. Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων.

Degree: 2005, University of Ioannina; Πανεπιστήμιο Ιωαννίνων

Subjects/Keywords: Πλήθος σκελετικών δέντρων; Αλγόριθμοι, Δυναμικός αναγνώρισης; Αλγόριθμοι, Βέλτιστος παράλληλος; Επικάλυψη με μονοπάτια; Κλάσεις τέλειων γραφημάτων; m - αποσύνθεση; Dynamic algorithm for recognition; Optimal parallel algorithm; Path cover; Classes of perfect graphs; Modular decomposition; Tree representation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Παπαδόπουλος, . . (2005). Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων. (Thesis). University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Retrieved from http://hdl.handle.net/10442/hedi/21180

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

Παπαδόπουλος, Χάρης. “Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων.” 2005. Thesis, University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Accessed October 17, 2019. http://hdl.handle.net/10442/hedi/21180.

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

MLA Handbook (7th Edition):

Παπαδόπουλος, Χάρης. “Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων.” 2005. Web. 17 Oct 2019.

Vancouver:

Παπαδόπουλος . Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων. [Internet] [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2005. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10442/hedi/21180.

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

Council of Science Editors:

Παπαδόπουλος . Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων. [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2005. Available from: http://hdl.handle.net/10442/hedi/21180

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

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

.