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

Dept: Computer Science and Engineering

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

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

Search Limiters

Last 2 Years | English Only

Universities

Degrees

Languages

Country

▼ Search Limiters


NSYSU

1. Hu, Jen-Wei. An ACGT-Words Tree for Efficient Data Access in Genomic Databases.

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

 Genomic sequence databases, like GenBank, EMBL, are widely used by molecular biologists for homology searching. Because of the increase of the size of genomic sequence… (more)

Subjects/Keywords: DNA sequence; genomic databases; indexing; suffix tree; suffix array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, J. (2003). An ACGT-Words Tree for Efficient Data Access in Genomic Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311

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

Hu, Jen-Wei. “An ACGT-Words Tree for Efficient Data Access in Genomic Databases.” 2003. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311.

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

MLA Handbook (7th Edition):

Hu, Jen-Wei. “An ACGT-Words Tree for Efficient Data Access in Genomic Databases.” 2003. Web. 21 Oct 2019.

Vancouver:

Hu J. An ACGT-Words Tree for Efficient Data Access in Genomic Databases. [Internet] [Thesis]. NSYSU; 2003. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311.

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

Council of Science Editors:

Hu J. An ACGT-Words Tree for Efficient Data Access in Genomic Databases. [Thesis]. NSYSU; 2003. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311

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


NSYSU

2. 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

3. 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


NSYSU

4. 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 21, 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. 21 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 21]. 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


NSYSU

5. Liao, Yu-Hsun. A Quantum-inspired Evolutionary Clustering Algorithm.

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

 In recent years, a lot of evolutionary computation methods have been proposed to solve the combinatorial optimization problem based on the concepts of quantum mechanics.… (more)

Subjects/Keywords: clustering; quantum-inspired evolutionary algorithm; Evolutionary algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, Y. (2014). A Quantum-inspired Evolutionary Clustering Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921

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, Yu-Hsun. “A Quantum-inspired Evolutionary Clustering Algorithm.” 2014. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921.

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

MLA Handbook (7th Edition):

Liao, Yu-Hsun. “A Quantum-inspired Evolutionary Clustering Algorithm.” 2014. Web. 21 Oct 2019.

Vancouver:

Liao Y. A Quantum-inspired Evolutionary Clustering Algorithm. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921.

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

Council of Science Editors:

Liao Y. A Quantum-inspired Evolutionary Clustering Algorithm. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921

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


NSYSU

6. Yang, You-Chuan. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.

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

 With the advance of computer and internet technologies, social networks have become an integral part of most peopleâs life. People can now use social networks… (more)

Subjects/Keywords: influence maximization problem; social network; meta-heuristic algorithm; genetic algorithm; NewGreedy algorithm; propagation model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, Y. (2016). A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418

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

Yang, You-Chuan. “A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.” 2016. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418.

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

MLA Handbook (7th Edition):

Yang, You-Chuan. “A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.” 2016. Web. 21 Oct 2019.

Vancouver:

Yang Y. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418.

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

Council of Science Editors:

Yang Y. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418

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


NSYSU

7. Weng, Hsiang-yi. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.

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

 The k-LCS problem is to find the longest common subsequence (LCS) of k input sequences. It is difficult while the number of input sequences is… (more)

Subjects/Keywords: Ant Colony Optimization Algorithm; genetic algorithm; longest common subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weng, H. (2009). A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733

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

Weng, Hsiang-yi. “A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733.

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

MLA Handbook (7th Edition):

Weng, Hsiang-yi. “A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Web. 21 Oct 2019.

Vancouver:

Weng H. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733.

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

Council of Science Editors:

Weng H. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733

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


NSYSU

8. Song, Huei-jyun. A Hyper-Heuristic Clustering Algorithm.

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

 The so-called heuristics have been widely used in solving combinatorial optimization problems because they provide a simple but effective way to find an approximate solution.… (more)

Subjects/Keywords: diversified detection; metaheuristics algorithm; clustering problem; Hyper-heuristic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Song, H. (2012). A Hyper-Heuristic Clustering Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759

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

Song, Huei-jyun. “A Hyper-Heuristic Clustering Algorithm.” 2012. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759.

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

MLA Handbook (7th Edition):

Song, Huei-jyun. “A Hyper-Heuristic Clustering Algorithm.” 2012. Web. 21 Oct 2019.

Vancouver:

Song H. A Hyper-Heuristic Clustering Algorithm. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759.

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

Council of Science Editors:

Song H. A Hyper-Heuristic Clustering Algorithm. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907112-211759

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


NSYSU

9. Lin, Feng-Shih. Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm.

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

 Feature selection is a pre-processing step in data-mining and machine learning, and plays an important role for analyzing high-dimensional data. Appropriately selected features can not… (more)

Subjects/Keywords: feature selection; genetic algorithm; grouping genetic algorithm; data mining; Attribute clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, F. (2011). Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933

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, Feng-Shih. “Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm.” 2011. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933.

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

MLA Handbook (7th Edition):

Lin, Feng-Shih. “Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm.” 2011. Web. 21 Oct 2019.

Vancouver:

Lin F. Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm. [Internet] [Thesis]. NSYSU; 2011. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933.

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

Council of Science Editors:

Lin F. Improved Approaches for Attribute Clustering Based on the Group Genetic Algorithm. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-070933

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


NSYSU

10. Tseng, Kuo-Tsung. Algorithms for Near-optimal Alignment Problems on Biosequences.

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

 With the improvement of biological techniques, the amount of biosequences data, such as DNA, RNA and protein sequences, are growing explosively. It is almost impossible… (more)

Subjects/Keywords: LCS; protein; biosequence; algorithm; near-optimal

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, K. (2008). Algorithms for Near-optimal Alignment Problems on Biosequences. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735

Chicago Manual of Style (16th Edition):

Tseng, Kuo-Tsung. “Algorithms for Near-optimal Alignment Problems on Biosequences.” 2008. Doctoral Dissertation, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735.

MLA Handbook (7th Edition):

Tseng, Kuo-Tsung. “Algorithms for Near-optimal Alignment Problems on Biosequences.” 2008. Web. 21 Oct 2019.

Vancouver:

Tseng K. Algorithms for Near-optimal Alignment Problems on Biosequences. [Internet] [Doctoral dissertation]. NSYSU; 2008. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735.

Council of Science Editors:

Tseng K. Algorithms for Near-optimal Alignment Problems on Biosequences. [Doctoral Dissertation]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0826108-182735


NSYSU

11. Chen, Ming-cheng. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.

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

 The microarray technology plays an important role of clinical oncology field. The patient can be diagnosed a symptom about cancer through microarray data. Currently, to… (more)

Subjects/Keywords: Microarray Data Classification; Genetic Algorithm; Fuzzy Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, M. (2008). A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834

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

Chen, Ming-cheng. “A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.” 2008. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834.

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

MLA Handbook (7th Edition):

Chen, Ming-cheng. “A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification.” 2008. Web. 21 Oct 2019.

Vancouver:

Chen M. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. [Internet] [Thesis]. NSYSU; 2008. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834.

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

Council of Science Editors:

Chen M. A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0930108-105834

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


NSYSU

12. Wu, De-kai. A Heuristic Algorithm for Maximizing Lifetime in Sensor Network.

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

 Wireless sensor network has applications in environmental surveillance, healthcare, and military operations. Because the energy of sensor nodes is limited and nodes are unable to… (more)

Subjects/Keywords: Heuristic Algorithm; Wireless Sensor Network; Lifetime

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, D. (2009). A Heuristic Algorithm for Maximizing Lifetime in Sensor Network. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428

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

Wu, De-kai. “A Heuristic Algorithm for Maximizing Lifetime in Sensor Network.” 2009. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428.

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

MLA Handbook (7th Edition):

Wu, De-kai. “A Heuristic Algorithm for Maximizing Lifetime in Sensor Network.” 2009. Web. 21 Oct 2019.

Vancouver:

Wu D. A Heuristic Algorithm for Maximizing Lifetime in Sensor Network. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428.

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

Council of Science Editors:

Wu D. A Heuristic Algorithm for Maximizing Lifetime in Sensor Network. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715109-154428

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


NSYSU

13. Lu, Yi-shan. Efficient Implementation of the Weil Pairing.

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

 The most efficient algorithm for solving the elliptic curve discrete logarithm problem can only be done in exponential time. Hence, we can use it in… (more)

Subjects/Keywords: Miller's algorithm; Weil Pairing; Elliptic Curve

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, Y. (2009). Efficient Implementation of the Weil Pairing. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209

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

Lu, Yi-shan. “Efficient Implementation of the Weil Pairing.” 2009. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209.

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

MLA Handbook (7th Edition):

Lu, Yi-shan. “Efficient Implementation of the Weil Pairing.” 2009. Web. 21 Oct 2019.

Vancouver:

Lu Y. Efficient Implementation of the Weil Pairing. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209.

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

Council of Science Editors:

Lu Y. Efficient Implementation of the Weil Pairing. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0831109-235209

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


NSYSU

14. Chou, Yan-Chi. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.

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

 The domain of computer music is an interesting area which combines computer science and music art. We propose a music accompaniment system using a variable-length… (more)

Subjects/Keywords: Chord Progression; Accompaniment; Variable-length Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chou, Y. (2009). Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344

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

Chou, Yan-Chi. “Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.” 2009. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344.

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

MLA Handbook (7th Edition):

Chou, Yan-Chi. “Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression.” 2009. Web. 21 Oct 2019.

Vancouver:

Chou Y. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344.

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

Council of Science Editors:

Chou Y. Style Music Accompaniment Using a Variable-length Genetic Algorithm with Chord Progression. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0910109-163344

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


NSYSU

15. Peng, Yung-Hsing. Algorithms for Scaled String Indexing and LCS Variants.

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

 Related problems of string indexing and sequence analysis have been widely studied for a long time. Recently, researchers turn to consider extended versions of these… (more)

Subjects/Keywords: longest common subsequence; scale; string indexing; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peng, Y. (2010). Algorithms for Scaled String Indexing and LCS Variants. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720110-150614

Chicago Manual of Style (16th Edition):

Peng, Yung-Hsing. “Algorithms for Scaled String Indexing and LCS Variants.” 2010. Doctoral Dissertation, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720110-150614.

MLA Handbook (7th Edition):

Peng, Yung-Hsing. “Algorithms for Scaled String Indexing and LCS Variants.” 2010. Web. 21 Oct 2019.

Vancouver:

Peng Y. Algorithms for Scaled String Indexing and LCS Variants. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720110-150614.

Council of Science Editors:

Peng Y. Algorithms for Scaled String Indexing and LCS Variants. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720110-150614


NSYSU

16. Chiang, Chung-Han. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.

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

 Various approaches have been proposed for finding the longest common subsequence (LCS) of two sequences. The time complexities of these algorithms are usually O(n2) in… (more)

Subjects/Keywords: longest common subsequence; multiple sequences; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiang, C. (2009). A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

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

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

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

MLA Handbook (7th Edition):

Chiang, Chung-Han. “A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Web. 21 Oct 2019.

Vancouver:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018.

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

Council of Science Editors:

Chiang C. A Genetic Algorithm for the Longest Common Subsequence of Multiple Sequences. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0106109-080018

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


NSYSU

17. Tsai, An-Hsiou. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.

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

 For a commercial port, to efficiently schedule the public berths is an important issue. Since a berth schedule would affect the usage of the commercial… (more)

Subjects/Keywords: Berth Scheduling; Genetic Algorithm; Taguchi Method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsai, A. (2011). Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639

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

Tsai, An-Hsiou. “Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.” 2011. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639.

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

MLA Handbook (7th Edition):

Tsai, An-Hsiou. “Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.” 2011. Web. 21 Oct 2019.

Vancouver:

Tsai A. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. [Internet] [Thesis]. NSYSU; 2011. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639.

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

Council of Science Editors:

Tsai A. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639

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


NSYSU

18. Tsai, Tzung-Yu. A Pricing-aware Resource Allocation Strategy for LTE Networks.

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

 With the rapid development of mobile networks, users require various kinds of application services. Therefore, telecommunication operators have to support different Qualities of service (QoS)… (more)

Subjects/Keywords: Downlink scheduler algorithm; LTE; QoS; Revenue; Pricing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsai, T. (2015). A Pricing-aware Resource Allocation Strategy for LTE Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-225146

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

Tsai, Tzung-Yu. “A Pricing-aware Resource Allocation Strategy for LTE Networks.” 2015. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-225146.

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

MLA Handbook (7th Edition):

Tsai, Tzung-Yu. “A Pricing-aware Resource Allocation Strategy for LTE Networks.” 2015. Web. 21 Oct 2019.

Vancouver:

Tsai T. A Pricing-aware Resource Allocation Strategy for LTE Networks. [Internet] [Thesis]. NSYSU; 2015. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-225146.

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

Council of Science Editors:

Tsai T. A Pricing-aware Resource Allocation Strategy for LTE Networks. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711115-225146

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


University of Notre Dame

19. Ewa Misiolek. Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>.

Degree: PhD, Computer Science and Engineering, 2011, University of Notre Dame

  Computer-aided manufacturing (CAM) is an area of manufacturing where computer algorithms are used for planning and controlling fabrication processes of three dimensional objects. Most… (more)

Subjects/Keywords: algorithm design; computational geometry; computer-aided manufacturing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Misiolek, E. (2011). Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/7m01bk14753

Chicago Manual of Style (16th Edition):

Misiolek, Ewa. “Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>.” 2011. Doctoral Dissertation, University of Notre Dame. Accessed October 21, 2019. https://curate.nd.edu/show/7m01bk14753.

MLA Handbook (7th Edition):

Misiolek, Ewa. “Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>.” 2011. Web. 21 Oct 2019.

Vancouver:

Misiolek E. Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2011. [cited 2019 Oct 21]. Available from: https://curate.nd.edu/show/7m01bk14753.

Council of Science Editors:

Misiolek E. Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>. [Doctoral Dissertation]. University of Notre Dame; 2011. Available from: https://curate.nd.edu/show/7m01bk14753


University of Notre Dame

20. Ewa Misiolek. Efficient Algorithms for Simplifying Flow Networks</h1>.

Degree: MSin Computer Science and Engineering, Computer Science and Engineering, 2003, University of Notre Dame

  Computing maximum flow in a flow network is one of the important areas of research with many practical applications. In order to reduce the… (more)

Subjects/Keywords: maximum flow; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Misiolek, E. (2003). Efficient Algorithms for Simplifying Flow Networks</h1>. (Masters Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/sb397655p6b

Chicago Manual of Style (16th Edition):

Misiolek, Ewa. “Efficient Algorithms for Simplifying Flow Networks</h1>.” 2003. Masters Thesis, University of Notre Dame. Accessed October 21, 2019. https://curate.nd.edu/show/sb397655p6b.

MLA Handbook (7th Edition):

Misiolek, Ewa. “Efficient Algorithms for Simplifying Flow Networks</h1>.” 2003. Web. 21 Oct 2019.

Vancouver:

Misiolek E. Efficient Algorithms for Simplifying Flow Networks</h1>. [Internet] [Masters thesis]. University of Notre Dame; 2003. [cited 2019 Oct 21]. Available from: https://curate.nd.edu/show/sb397655p6b.

Council of Science Editors:

Misiolek E. Efficient Algorithms for Simplifying Flow Networks</h1>. [Masters Thesis]. University of Notre Dame; 2003. Available from: https://curate.nd.edu/show/sb397655p6b


NSYSU

21. Yang, Chao-ping. Routing Policy for D2D Group Communication.

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

 Cisco predicted that mobile traffic will reach over 120 exabytes per month in 2018. Because of that, the Third Generation Partnership Project (3GPP) proposed a… (more)

Subjects/Keywords: Group Communication; Routing algorithm; Device-to-Device; Long Term Evolution Advanced; A* algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, C. (2017). Routing Policy for D2D Group Communication. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806117-173724

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

Yang, Chao-ping. “Routing Policy for D2D Group Communication.” 2017. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806117-173724.

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

MLA Handbook (7th Edition):

Yang, Chao-ping. “Routing Policy for D2D Group Communication.” 2017. Web. 21 Oct 2019.

Vancouver:

Yang C. Routing Policy for D2D Group Communication. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806117-173724.

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

Council of Science Editors:

Yang C. Routing Policy for D2D Group Communication. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806117-173724

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


NSYSU

22. Lin, Ning-yan. Dynamic Grouping Algorithms For RFID Tag Identification.

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

 In passive RFID systems, how to reduce the collision among tags is an important issue at the medium access control layer. The Framed Slotted ALOHA… (more)

Subjects/Keywords: passive RFID systems; framed slotted ALOHA; anti-collision algorithm; Dynamic Grouping algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, N. (2010). Dynamic Grouping Algorithms For RFID Tag Identification. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-235656

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, Ning-yan. “Dynamic Grouping Algorithms For RFID Tag Identification.” 2010. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-235656.

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

MLA Handbook (7th Edition):

Lin, Ning-yan. “Dynamic Grouping Algorithms For RFID Tag Identification.” 2010. Web. 21 Oct 2019.

Vancouver:

Lin N. Dynamic Grouping Algorithms For RFID Tag Identification. [Internet] [Thesis]. NSYSU; 2010. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-235656.

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

Council of Science Editors:

Lin N. Dynamic Grouping Algorithms For RFID Tag Identification. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-235656

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


NSYSU

23. Chen, Chia-Wen. Energy-Efficient Multiple-Word Montgomery Modular Multiplier.

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

 Nowadays, Internet plays an indispensable role in human lives. People use Internet to search information, transmit data, download ?le, and so on. The data transformed… (more)

Subjects/Keywords: Multiple-Word Radix-2 Montgomery Algorithm; Low-Power; Energy-Efficient; RSA Cryptosystems; Montgomeryâs Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, C. (2012). Energy-Efficient Multiple-Word Montgomery Modular Multiplier. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725112-103944

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

Chen, Chia-Wen. “Energy-Efficient Multiple-Word Montgomery Modular Multiplier.” 2012. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725112-103944.

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

MLA Handbook (7th Edition):

Chen, Chia-Wen. “Energy-Efficient Multiple-Word Montgomery Modular Multiplier.” 2012. Web. 21 Oct 2019.

Vancouver:

Chen C. Energy-Efficient Multiple-Word Montgomery Modular Multiplier. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725112-103944.

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

Council of Science Editors:

Chen C. Energy-Efficient Multiple-Word Montgomery Modular Multiplier. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725112-103944

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


NSYSU

24. CHEN, YAN-RONG. An Improved Quantum-Inspired Evolutionary Data Clustering Algorithm.

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

 Many metaheuristic algorithms have been presented to find an approximate solution for the data clustering problem in recent years. To understand the capability of quantum-based… (more)

Subjects/Keywords: Metaheuristic Algorithm; Clustering Problem; Quantum-Inspired Evolutionary Algorithm; Data Clustering; Evolutionary Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

CHEN, Y. (2018). An Improved Quantum-Inspired Evolutionary Data Clustering Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722118-195736

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

CHEN, YAN-RONG. “An Improved Quantum-Inspired Evolutionary Data Clustering Algorithm.” 2018. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722118-195736.

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

MLA Handbook (7th Edition):

CHEN, YAN-RONG. “An Improved Quantum-Inspired Evolutionary Data Clustering Algorithm.” 2018. Web. 21 Oct 2019.

Vancouver:

CHEN Y. An Improved Quantum-Inspired Evolutionary Data Clustering Algorithm. [Internet] [Thesis]. NSYSU; 2018. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722118-195736.

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

Council of Science Editors:

CHEN Y. An Improved Quantum-Inspired Evolutionary Data Clustering Algorithm. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722118-195736

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

25. Rani, Swarupa K. A study on tree based association rule extraction system; -.

Degree: Computer Science and Engineering, 2012, Acharya Nagarjuna University

None

Reference p.147 - 162 and Publication given

Advisors/Committee Members: Prasad, Kamakshi V.

Subjects/Keywords: association; extraction system; study; tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rani, S. K. (2012). A study on tree based association rule extraction system; -. (Thesis). Acharya Nagarjuna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/40967

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

Rani, Swarupa K. “A study on tree based association rule extraction system; -.” 2012. Thesis, Acharya Nagarjuna University. Accessed October 21, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/40967.

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

MLA Handbook (7th Edition):

Rani, Swarupa K. “A study on tree based association rule extraction system; -.” 2012. Web. 21 Oct 2019.

Vancouver:

Rani SK. A study on tree based association rule extraction system; -. [Internet] [Thesis]. Acharya Nagarjuna University; 2012. [cited 2019 Oct 21]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/40967.

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

Council of Science Editors:

Rani SK. A study on tree based association rule extraction system; -. [Thesis]. Acharya Nagarjuna University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/40967

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

26. Rani, Swarupa K. A study on tree based association rule extraction system; -.

Degree: Computer Science and Engineering, 2012, Acharya Nagarjuna University

None

Reference p.147 - 162 and Publication given

Advisors/Committee Members: Prasad, Kamakshi V.

Subjects/Keywords: association; extraction system; study; tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rani, S. K. (2012). A study on tree based association rule extraction system; -. (Thesis). Acharya Nagarjuna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/39045

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

Rani, Swarupa K. “A study on tree based association rule extraction system; -.” 2012. Thesis, Acharya Nagarjuna University. Accessed October 21, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/39045.

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

MLA Handbook (7th Edition):

Rani, Swarupa K. “A study on tree based association rule extraction system; -.” 2012. Web. 21 Oct 2019.

Vancouver:

Rani SK. A study on tree based association rule extraction system; -. [Internet] [Thesis]. Acharya Nagarjuna University; 2012. [cited 2019 Oct 21]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39045.

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

Council of Science Editors:

Rani SK. A study on tree based association rule extraction system; -. [Thesis]. Acharya Nagarjuna University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39045

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


NSYSU

27. Liu, Hung-ze. AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems.

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

 In the future, more data intensive applications, such as P2P auction networks, P2P job – search networks, P2P multi – player games, will require the capability to… (more)

Subjects/Keywords: Spatial Data; Hashing Function; Nearest Neighbor Query; P2P Systems; Tree Structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, H. (2008). AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108

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

Liu, Hung-ze. “AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems.” 2008. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108.

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

MLA Handbook (7th Edition):

Liu, Hung-ze. “AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems.” 2008. Web. 21 Oct 2019.

Vancouver:

Liu H. AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems. [Internet] [Thesis]. NSYSU; 2008. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108.

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

Council of Science Editors:

Liu H. AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108

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


NSYSU

28. Tsai, Ming-te. A vEB-Tree based Strategy for Interactive VoD Services in P2P Networks.

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

 To provide interactive operations such as fast-forward, slow-forward, switch channel, and jump function for peer-to-peer on demand video streaming is a challenge. In this thesis,… (more)

Subjects/Keywords: Video on demand; VoD; Interactive; Peer-to-peer; vEB-tree; P2P

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsai, M. (2009). A vEB-Tree based Strategy for Interactive VoD Services in P2P Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828109-151157

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

Tsai, Ming-te. “A vEB-Tree based Strategy for Interactive VoD Services in P2P Networks.” 2009. Thesis, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828109-151157.

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

MLA Handbook (7th Edition):

Tsai, Ming-te. “A vEB-Tree based Strategy for Interactive VoD Services in P2P Networks.” 2009. Web. 21 Oct 2019.

Vancouver:

Tsai M. A vEB-Tree based Strategy for Interactive VoD Services in P2P Networks. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828109-151157.

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

Council of Science Editors:

Tsai M. A vEB-Tree based Strategy for Interactive VoD Services in P2P Networks. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0828109-151157

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


NSYSU

29. Chen, Hue-Ling. Efficient Spatial Access Methods for Spatial Queries in Spatio-Temporal Databases.

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

 With the large number of spatial queries for spatial data objects changing with time in many applications, e.g., the location based services and geographic information… (more)

Subjects/Keywords: Hilbert Curve; Spatial Index; Spatial Queries; Spatial Access Method; NA-Tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, H. (2011). Efficient Spatial Access Methods for Spatial Queries in Spatio-Temporal Databases. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0520111-020501

Chicago Manual of Style (16th Edition):

Chen, Hue-Ling. “Efficient Spatial Access Methods for Spatial Queries in Spatio-Temporal Databases.” 2011. Doctoral Dissertation, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0520111-020501.

MLA Handbook (7th Edition):

Chen, Hue-Ling. “Efficient Spatial Access Methods for Spatial Queries in Spatio-Temporal Databases.” 2011. Web. 21 Oct 2019.

Vancouver:

Chen H. Efficient Spatial Access Methods for Spatial Queries in Spatio-Temporal Databases. [Internet] [Doctoral dissertation]. NSYSU; 2011. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0520111-020501.

Council of Science Editors:

Chen H. Efficient Spatial Access Methods for Spatial Queries in Spatio-Temporal Databases. [Doctoral Dissertation]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0520111-020501


NSYSU

30. Chen, Yi-Chang. Measurement and Improvement of Packet Classification by Non-Sequential IP Lookup Mechanism and SCTP Multi-Path Switch.

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

 IP Lookup uses IP address information to help Routers and related network devices determine next-hop. Internet security is threatened by considerable anomalous activities including intrusion… (more)

Subjects/Keywords: SCTP; IP Address; Pipeline; handoff; delay; Threaded tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2014). Measurement and Improvement of Packet Classification by Non-Sequential IP Lookup Mechanism and SCTP Multi-Path Switch. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0628114-183011

Chicago Manual of Style (16th Edition):

Chen, Yi-Chang. “Measurement and Improvement of Packet Classification by Non-Sequential IP Lookup Mechanism and SCTP Multi-Path Switch.” 2014. Doctoral Dissertation, NSYSU. Accessed October 21, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0628114-183011.

MLA Handbook (7th Edition):

Chen, Yi-Chang. “Measurement and Improvement of Packet Classification by Non-Sequential IP Lookup Mechanism and SCTP Multi-Path Switch.” 2014. Web. 21 Oct 2019.

Vancouver:

Chen Y. Measurement and Improvement of Packet Classification by Non-Sequential IP Lookup Mechanism and SCTP Multi-Path Switch. [Internet] [Doctoral dissertation]. NSYSU; 2014. [cited 2019 Oct 21]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0628114-183011.

Council of Science Editors:

Chen Y. Measurement and Improvement of Packet Classification by Non-Sequential IP Lookup Mechanism and SCTP Multi-Path Switch. [Doctoral Dissertation]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0628114-183011

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

.