Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Edit distance). Showing records 1 – 30 of 34 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Alberta

1. Mikhaiel, Rimon A. E. Comparing XML Documents as Reference-aware Labeled Ordered Trees.

Degree: PhD, Department of Computing Science, 2011, University of Alberta

 XML, the Extensible Markup Language, is the standard exchange format for modern Information Systems, Service Oriented Architecture (SOA) and the Semantic Web. Hence, comparing XML… (more)

Subjects/Keywords: XML Differencing; Tree Edit Distance; Ontology Matching; XML Edit Distance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mikhaiel, R. A. E. (2011). Comparing XML Documents as Reference-aware Labeled Ordered Trees. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/6108vc18d

Chicago Manual of Style (16th Edition):

Mikhaiel, Rimon A E. “Comparing XML Documents as Reference-aware Labeled Ordered Trees.” 2011. Doctoral Dissertation, University of Alberta. Accessed November 17, 2017. https://era.library.ualberta.ca/files/6108vc18d.

MLA Handbook (7th Edition):

Mikhaiel, Rimon A E. “Comparing XML Documents as Reference-aware Labeled Ordered Trees.” 2011. Web. 17 Nov 2017.

Vancouver:

Mikhaiel RAE. Comparing XML Documents as Reference-aware Labeled Ordered Trees. [Internet] [Doctoral dissertation]. University of Alberta; 2011. [cited 2017 Nov 17]. Available from: https://era.library.ualberta.ca/files/6108vc18d.

Council of Science Editors:

Mikhaiel RAE. Comparing XML Documents as Reference-aware Labeled Ordered Trees. [Doctoral Dissertation]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/6108vc18d


Rochester Institute of Technology

2. Kakkar, Himesh. Automated Grading and Feedback of Regular Expressions.

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

  To keep up with the current spread of education, there has arisen the need to have automated tools to evaluate assignments. As a part… (more)

Subjects/Keywords: Edit distance; Evaluation; Grade; Regular expression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kakkar, H. (2017). Automated Grading and Feedback of Regular Expressions. (Masters Thesis). Rochester Institute of Technology. Retrieved from http://scholarworks.rit.edu/theses/9394

Chicago Manual of Style (16th Edition):

Kakkar, Himesh. “Automated Grading and Feedback of Regular Expressions.” 2017. Masters Thesis, Rochester Institute of Technology. Accessed November 17, 2017. http://scholarworks.rit.edu/theses/9394.

MLA Handbook (7th Edition):

Kakkar, Himesh. “Automated Grading and Feedback of Regular Expressions.” 2017. Web. 17 Nov 2017.

Vancouver:

Kakkar H. Automated Grading and Feedback of Regular Expressions. [Internet] [Masters thesis]. Rochester Institute of Technology; 2017. [cited 2017 Nov 17]. Available from: http://scholarworks.rit.edu/theses/9394.

Council of Science Editors:

Kakkar H. Automated Grading and Feedback of Regular Expressions. [Masters Thesis]. Rochester Institute of Technology; 2017. Available from: http://scholarworks.rit.edu/theses/9394


NSYSU

3. Lin, Shian-liang. A Survey on the Algorithms of the Edit Distance Problem and Related Variants.

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

 Abstract The edit distance problem has been studied for several decades. Given sequences (strings) A and B with length m and n, respectively, m ⤅ (more)

Subjects/Keywords: Genome Rearrangement; Similarity; Dynamic Programing; Longest Common Subsequence; Edit Distance; Block Edit

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, S. (2016). A Survey on the Algorithms of the Edit Distance Problem and Related Variants. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529

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, Shian-liang. “A Survey on the Algorithms of the Edit Distance Problem and Related Variants.” 2016. Thesis, NSYSU. Accessed November 17, 2017. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529.

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

MLA Handbook (7th Edition):

Lin, Shian-liang. “A Survey on the Algorithms of the Edit Distance Problem and Related Variants.” 2016. Web. 17 Nov 2017.

Vancouver:

Lin S. A Survey on the Algorithms of the Edit Distance Problem and Related Variants. [Internet] [Thesis]. NSYSU; 2016. [cited 2017 Nov 17]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529.

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

Council of Science Editors:

Lin S. A Survey on the Algorithms of the Edit Distance Problem and Related Variants. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529

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


University of Edinburgh

4. Sullivan, Jennifer Niamh. Approaching intonational distance and change.

Degree: PhD, 2011, University of Edinburgh

 The main aim of this thesis is to begin to extend phonetic distance measurements to the domain of intonation. Existing studies of segmental phonetic distance(more)

Subjects/Keywords: 410; phonetic distance; edit distance; intonation; English varieties; language change

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sullivan, J. N. (2011). Approaching intonational distance and change. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5619

Chicago Manual of Style (16th Edition):

Sullivan, Jennifer Niamh. “Approaching intonational distance and change.” 2011. Doctoral Dissertation, University of Edinburgh. Accessed November 17, 2017. http://hdl.handle.net/1842/5619.

MLA Handbook (7th Edition):

Sullivan, Jennifer Niamh. “Approaching intonational distance and change.” 2011. Web. 17 Nov 2017.

Vancouver:

Sullivan JN. Approaching intonational distance and change. [Internet] [Doctoral dissertation]. University of Edinburgh; 2011. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/1842/5619.

Council of Science Editors:

Sullivan JN. Approaching intonational distance and change. [Doctoral Dissertation]. University of Edinburgh; 2011. Available from: http://hdl.handle.net/1842/5619


San Jose State University

5. Patel, Mahim. Similarity Tests for Metamorphic Virus Detection.

Degree: MSSE, Computer Science, 2011, San Jose State University

  A metamorphic computer virus generates copies of itself using code morphing techniques. A new virus has the same functionality as the parent but it… (more)

Subjects/Keywords: HMM edit distance sequence alignment Metamorphic Virus Detection; Other Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patel, M. (2011). Similarity Tests for Metamorphic Virus Detection. (Masters Thesis). San Jose State University. Retrieved from http://scholarworks.sjsu.edu/etd_projects/175

Chicago Manual of Style (16th Edition):

Patel, Mahim. “Similarity Tests for Metamorphic Virus Detection.” 2011. Masters Thesis, San Jose State University. Accessed November 17, 2017. http://scholarworks.sjsu.edu/etd_projects/175.

MLA Handbook (7th Edition):

Patel, Mahim. “Similarity Tests for Metamorphic Virus Detection.” 2011. Web. 17 Nov 2017.

Vancouver:

Patel M. Similarity Tests for Metamorphic Virus Detection. [Internet] [Masters thesis]. San Jose State University; 2011. [cited 2017 Nov 17]. Available from: http://scholarworks.sjsu.edu/etd_projects/175.

Council of Science Editors:

Patel M. Similarity Tests for Metamorphic Virus Detection. [Masters Thesis]. San Jose State University; 2011. Available from: http://scholarworks.sjsu.edu/etd_projects/175


University of New South Wales

6. Qin, Jianbin. Efficient String Similarity Search with an Edit Distance Threshold.

Degree: Computer Science & Engineering, 2013, University of New South Wales

 In this thesis, we study efficient exact query processing algorithms for edit similarity queries and their variants. An edit similarity query finds database strings within… (more)

Subjects/Keywords: edit distance; similarity joins; similarity search; autocompletion; type-ahead; inverted index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qin, J. (2013). Efficient String Similarity Search with an Edit Distance Threshold. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52648

Chicago Manual of Style (16th Edition):

Qin, Jianbin. “Efficient String Similarity Search with an Edit Distance Threshold.” 2013. Doctoral Dissertation, University of New South Wales. Accessed November 17, 2017. http://handle.unsw.edu.au/1959.4/52648.

MLA Handbook (7th Edition):

Qin, Jianbin. “Efficient String Similarity Search with an Edit Distance Threshold.” 2013. Web. 17 Nov 2017.

Vancouver:

Qin J. Efficient String Similarity Search with an Edit Distance Threshold. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2017 Nov 17]. Available from: http://handle.unsw.edu.au/1959.4/52648.

Council of Science Editors:

Qin J. Efficient String Similarity Search with an Edit Distance Threshold. [Doctoral Dissertation]. University of New South Wales; 2013. Available from: http://handle.unsw.edu.au/1959.4/52648

7. 髙畠, 嘉将. Online Grammar-Based Self-Index and Its Applications : オンライン文法圧縮に基づく自己索引とそのアプリケーション.

Degree: 博士(情報工学), 2017, Kyushu Institute of Technology / 九州工業大学

Text collections including many repetitions of substrings, called highly repetitive text collections, have been increasing in various fields like the version control system and the… (more)

Subjects/Keywords: Grammar-based self-index; Grammar Compression; Edit distance with moves; Frequent pattern discovery; Edit-sensitive parsing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

髙畠, . . (2017). Online Grammar-Based Self-Index and Its Applications : オンライン文法圧縮に基づく自己索引とそのアプリケーション. (Thesis). Kyushu Institute of Technology / 九州工業大学. Retrieved from http://hdl.handle.net/10228/00006315

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

髙畠, 嘉将. “Online Grammar-Based Self-Index and Its Applications : オンライン文法圧縮に基づく自己索引とそのアプリケーション.” 2017. Thesis, Kyushu Institute of Technology / 九州工業大学. Accessed November 17, 2017. http://hdl.handle.net/10228/00006315.

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

MLA Handbook (7th Edition):

髙畠, 嘉将. “Online Grammar-Based Self-Index and Its Applications : オンライン文法圧縮に基づく自己索引とそのアプリケーション.” 2017. Web. 17 Nov 2017.

Vancouver:

髙畠 . Online Grammar-Based Self-Index and Its Applications : オンライン文法圧縮に基づく自己索引とそのアプリケーション. [Internet] [Thesis]. Kyushu Institute of Technology / 九州工業大学; 2017. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/10228/00006315.

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

Council of Science Editors:

髙畠 . Online Grammar-Based Self-Index and Its Applications : オンライン文法圧縮に基づく自己索引とそのアプリケーション. [Thesis]. Kyushu Institute of Technology / 九州工業大学; 2017. Available from: http://hdl.handle.net/10228/00006315

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


NSYSU

8. Ann, Hsing-Yen. Efficient Algorithms for the Block Edit Distance and Related Problems.

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

 Computing the similarity of two strings or sequences is one of the most important fundamental in computer field, and it has been widely studied for… (more)

Subjects/Keywords: run-length encoding; longest common subsequence; dynamic programming; similarity; design of algorithms; block edit distance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ann, H. (2010). Efficient Algorithms for the Block Edit Distance and Related Problems. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424

Chicago Manual of Style (16th Edition):

Ann, Hsing-Yen. “Efficient Algorithms for the Block Edit Distance and Related Problems.” 2010. Doctoral Dissertation, NSYSU. Accessed November 17, 2017. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424.

MLA Handbook (7th Edition):

Ann, Hsing-Yen. “Efficient Algorithms for the Block Edit Distance and Related Problems.” 2010. Web. 17 Nov 2017.

Vancouver:

Ann H. Efficient Algorithms for the Block Edit Distance and Related Problems. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2017 Nov 17]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424.

Council of Science Editors:

Ann H. Efficient Algorithms for the Block Edit Distance and Related Problems. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424


EPFL

9. Shao, Mingfu. Models and Algorithms for Comparative Genomics.

Degree: 2015, EPFL

 The deluge of sequenced whole-genome data has motivated the study of comparative genomics, which provides global views on genome evolution, and also offers practical solutions… (more)

Subjects/Keywords: rearrangement; inversion; double-cut-and-join; edit distance; median; geneduplication; ortholog; paralog; integer linear program

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shao, M. (2015). Models and Algorithms for Comparative Genomics. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/209735

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

Shao, Mingfu. “Models and Algorithms for Comparative Genomics.” 2015. Thesis, EPFL. Accessed November 17, 2017. http://infoscience.epfl.ch/record/209735.

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

MLA Handbook (7th Edition):

Shao, Mingfu. “Models and Algorithms for Comparative Genomics.” 2015. Web. 17 Nov 2017.

Vancouver:

Shao M. Models and Algorithms for Comparative Genomics. [Internet] [Thesis]. EPFL; 2015. [cited 2017 Nov 17]. Available from: http://infoscience.epfl.ch/record/209735.

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

Council of Science Editors:

Shao M. Models and Algorithms for Comparative Genomics. [Thesis]. EPFL; 2015. Available from: http://infoscience.epfl.ch/record/209735

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


University of St. Andrews

10. McCaffery, Martin. The mat sat on the cat : investigating structure in the evaluation of order in machine translation .

Degree: 2017, University of St. Andrews

 We present a multifaceted investigation into the relevance of word order in machine translation. We introduce two tools, DTED and DERP, each using dependency structure… (more)

Subjects/Keywords: Machine translation; Natural language processing; Translation evaluation; Dependency structure; Evaluation dataset; Tree edit distance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McCaffery, M. (2017). The mat sat on the cat : investigating structure in the evaluation of order in machine translation . (Thesis). University of St. Andrews. Retrieved from http://hdl.handle.net/10023/12080

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

McCaffery, Martin. “The mat sat on the cat : investigating structure in the evaluation of order in machine translation .” 2017. Thesis, University of St. Andrews. Accessed November 17, 2017. http://hdl.handle.net/10023/12080.

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

MLA Handbook (7th Edition):

McCaffery, Martin. “The mat sat on the cat : investigating structure in the evaluation of order in machine translation .” 2017. Web. 17 Nov 2017.

Vancouver:

McCaffery M. The mat sat on the cat : investigating structure in the evaluation of order in machine translation . [Internet] [Thesis]. University of St. Andrews; 2017. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/10023/12080.

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

Council of Science Editors:

McCaffery M. The mat sat on the cat : investigating structure in the evaluation of order in machine translation . [Thesis]. University of St. Andrews; 2017. Available from: http://hdl.handle.net/10023/12080

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


University of New South Wales

11. Feng, Xing. Efficiently computing graph similarity and graph connectivity.

Degree: Computer Science & Engineering, 2017, University of New South Wales

 In many real applications, entities and their relationships can often be modeled as a graph G = (V,E) such that entities of interest are represented… (more)

Subjects/Keywords: Graph Edit Distance (GED); Computing graph similarity; Graph connectivity; 2-Edge-Connected Components (ECCs)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feng, X. (2017). Efficiently computing graph similarity and graph connectivity. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/58842

Chicago Manual of Style (16th Edition):

Feng, Xing. “Efficiently computing graph similarity and graph connectivity.” 2017. Doctoral Dissertation, University of New South Wales. Accessed November 17, 2017. http://handle.unsw.edu.au/1959.4/58842.

MLA Handbook (7th Edition):

Feng, Xing. “Efficiently computing graph similarity and graph connectivity.” 2017. Web. 17 Nov 2017.

Vancouver:

Feng X. Efficiently computing graph similarity and graph connectivity. [Internet] [Doctoral dissertation]. University of New South Wales; 2017. [cited 2017 Nov 17]. Available from: http://handle.unsw.edu.au/1959.4/58842.

Council of Science Editors:

Feng X. Efficiently computing graph similarity and graph connectivity. [Doctoral Dissertation]. University of New South Wales; 2017. Available from: http://handle.unsw.edu.au/1959.4/58842

12. Nguyen, Hong-Thinh. Approximate string matching distance for image classification : Distance d’édition entre chaines d’histogrammes pour la classification d’images.

Degree: Docteur es, Informatique, 2014, Saint-Etienne

L'augmentation exponentielle du nombre d'images nécessite des moyens efficaces pour les classer en fonction de leur contenu visuel. Le sac de mot visuel (Bag-Of-visual-Words, BOW),… (more)

Subjects/Keywords: Distance d'édition; Sac de mots visuels; Correspondance spatiale; Classification d'images; Edit distance; Bag of visual words; Spatial matching; Image classification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, H. (2014). Approximate string matching distance for image classification : Distance d’édition entre chaines d’histogrammes pour la classification d’images. (Doctoral Dissertation). Saint-Etienne. Retrieved from http://www.theses.fr/2014STET4029

Chicago Manual of Style (16th Edition):

Nguyen, Hong-Thinh. “Approximate string matching distance for image classification : Distance d’édition entre chaines d’histogrammes pour la classification d’images.” 2014. Doctoral Dissertation, Saint-Etienne. Accessed November 17, 2017. http://www.theses.fr/2014STET4029.

MLA Handbook (7th Edition):

Nguyen, Hong-Thinh. “Approximate string matching distance for image classification : Distance d’édition entre chaines d’histogrammes pour la classification d’images.” 2014. Web. 17 Nov 2017.

Vancouver:

Nguyen H. Approximate string matching distance for image classification : Distance d’édition entre chaines d’histogrammes pour la classification d’images. [Internet] [Doctoral dissertation]. Saint-Etienne; 2014. [cited 2017 Nov 17]. Available from: http://www.theses.fr/2014STET4029.

Council of Science Editors:

Nguyen H. Approximate string matching distance for image classification : Distance d’édition entre chaines d’histogrammes pour la classification d’images. [Doctoral Dissertation]. Saint-Etienne; 2014. Available from: http://www.theses.fr/2014STET4029


University of Georgia

13. Yin, Sheng. A pattern-based annotation approach: an ontology-driven rote extractor for pattern disambiguiation.

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

 One difficulty that prevents a machine from searching, retrieving and processing web content through the World Wide Web (WWW) is that most web content is… (more)

Subjects/Keywords: Edit-Distance; Lexical Pattern; OWL; Ontology Query; Pattern disambiguation; Pattern Generalization; POS tagging; NER and Semantic Web

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yin, S. (2009). A pattern-based annotation approach: an ontology-driven rote extractor for pattern disambiguiation. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/yin_sheng_200912_ms

Chicago Manual of Style (16th Edition):

Yin, Sheng. “A pattern-based annotation approach: an ontology-driven rote extractor for pattern disambiguiation.” 2009. Masters Thesis, University of Georgia. Accessed November 17, 2017. http://purl.galileo.usg.edu/uga_etd/yin_sheng_200912_ms.

MLA Handbook (7th Edition):

Yin, Sheng. “A pattern-based annotation approach: an ontology-driven rote extractor for pattern disambiguiation.” 2009. Web. 17 Nov 2017.

Vancouver:

Yin S. A pattern-based annotation approach: an ontology-driven rote extractor for pattern disambiguiation. [Internet] [Masters thesis]. University of Georgia; 2009. [cited 2017 Nov 17]. Available from: http://purl.galileo.usg.edu/uga_etd/yin_sheng_200912_ms.

Council of Science Editors:

Yin S. A pattern-based annotation approach: an ontology-driven rote extractor for pattern disambiguiation. [Masters Thesis]. University of Georgia; 2009. Available from: http://purl.galileo.usg.edu/uga_etd/yin_sheng_200912_ms


University of Oxford

14. Riveros Jaeger, Cristian. Repairing strings and trees.

Degree: PhD, 2013, University of Oxford

 What do you do if a computational object fails a specification? An obvious approach is to repair it, namely, to modify the object minimally to… (more)

Subjects/Keywords: 005.14; Computer science (mathematics); Theory and automated verification; Automata theory; repair; edit distance; strings; trees; tree automata; XML Schema

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Riveros Jaeger, C. (2013). Repairing strings and trees. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260

Chicago Manual of Style (16th Edition):

Riveros Jaeger, Cristian. “Repairing strings and trees.” 2013. Doctoral Dissertation, University of Oxford. Accessed November 17, 2017. http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260.

MLA Handbook (7th Edition):

Riveros Jaeger, Cristian. “Repairing strings and trees.” 2013. Web. 17 Nov 2017.

Vancouver:

Riveros Jaeger C. Repairing strings and trees. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2017 Nov 17]. Available from: http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260.

Council of Science Editors:

Riveros Jaeger C. Repairing strings and trees. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260


University of Pretoria

15. Liang, Hsuan Lorraine. Spell checkers and correctors : a unified treatment.

Degree: Computer Science, 2009, University of Pretoria

 The aim of this dissertation is to provide a unified treatment of various spell checkers and correctors. Firstly, the spell checking and correcting problems are… (more)

Subjects/Keywords: Performance; N-gram; Fsa; Formal concept analysis; Edit distance; Dictionary lookup; Classification; Spell checking; Spell correcting; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liang, H. (2009). Spell checkers and correctors : a unified treatment. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/25833

Chicago Manual of Style (16th Edition):

Liang, Hsuan. “Spell checkers and correctors : a unified treatment.” 2009. Masters Thesis, University of Pretoria. Accessed November 17, 2017. http://hdl.handle.net/2263/25833.

MLA Handbook (7th Edition):

Liang, Hsuan. “Spell checkers and correctors : a unified treatment.” 2009. Web. 17 Nov 2017.

Vancouver:

Liang H. Spell checkers and correctors : a unified treatment. [Internet] [Masters thesis]. University of Pretoria; 2009. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/2263/25833.

Council of Science Editors:

Liang H. Spell checkers and correctors : a unified treatment. [Masters Thesis]. University of Pretoria; 2009. Available from: http://hdl.handle.net/2263/25833


University of Pretoria

16. [No author]. Spell checkers and correctors : a unified treatment .

Degree: 2009, University of Pretoria

 The aim of this dissertation is to provide a unified treatment of various spell checkers and correctors. Firstly, the spell checking and correcting problems are… (more)

Subjects/Keywords: Performance; N-gram; Fsa; Formal concept analysis; Edit distance; Dictionary lookup; Classification; Spell checking; Spell correcting; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2009). Spell checkers and correctors : a unified treatment . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-06252009-163007/

Chicago Manual of Style (16th Edition):

author], [No. “Spell checkers and correctors : a unified treatment .” 2009. Masters Thesis, University of Pretoria. Accessed November 17, 2017. http://upetd.up.ac.za/thesis/available/etd-06252009-163007/.

MLA Handbook (7th Edition):

author], [No. “Spell checkers and correctors : a unified treatment .” 2009. Web. 17 Nov 2017.

Vancouver:

author] [. Spell checkers and correctors : a unified treatment . [Internet] [Masters thesis]. University of Pretoria; 2009. [cited 2017 Nov 17]. Available from: http://upetd.up.ac.za/thesis/available/etd-06252009-163007/.

Council of Science Editors:

author] [. Spell checkers and correctors : a unified treatment . [Masters Thesis]. University of Pretoria; 2009. Available from: http://upetd.up.ac.za/thesis/available/etd-06252009-163007/


Université Catholique de Louvain

17. García Díez, Silvia. Randomized shortest paths and their applications.

Degree: 2015, Université Catholique de Louvain

In graph analysis, the Shortest Path problem identifies the optimal, most cost effective, path between two nodes. This problem has been the object of many… (more)

Subjects/Keywords: Music retrieval; Edit distance; Graph and network analysis; Machine learning; Path planning; Randomized shortest paths; Game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

García Díez, S. (2015). Randomized shortest paths and their applications. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/165618

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

García Díez, Silvia. “Randomized shortest paths and their applications.” 2015. Thesis, Université Catholique de Louvain. Accessed November 17, 2017. http://hdl.handle.net/2078.1/165618.

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

MLA Handbook (7th Edition):

García Díez, Silvia. “Randomized shortest paths and their applications.” 2015. Web. 17 Nov 2017.

Vancouver:

García Díez S. Randomized shortest paths and their applications. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/2078.1/165618.

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

Council of Science Editors:

García Díez S. Randomized shortest paths and their applications. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/165618

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

18. Bellet, Aurélien. Supervised metric learning with generalization guarantees : Apprentissage supervisé de métriques avec garanties en généralisation.

Degree: Docteur es, Informatique, 2012, Saint-Etienne

 Ces dernières années, l'importance cruciale des métriques en apprentissage automatique a mené à un intérêt grandissant pour l'optimisation de distances et de similarités en utilisant… (more)

Subjects/Keywords: Apprentissage de métriques; Apprentissage statistique; Optimisation convexe; Classification; Données structurées; Distance d'édition; Bornes en généralisation; Metric learning; Statistical learning; Convex optimization; Classification; Structured data; Edit distance; Generalization bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bellet, A. (2012). Supervised metric learning with generalization guarantees : Apprentissage supervisé de métriques avec garanties en généralisation. (Doctoral Dissertation). Saint-Etienne. Retrieved from http://www.theses.fr/2012STET4003

Chicago Manual of Style (16th Edition):

Bellet, Aurélien. “Supervised metric learning with generalization guarantees : Apprentissage supervisé de métriques avec garanties en généralisation.” 2012. Doctoral Dissertation, Saint-Etienne. Accessed November 17, 2017. http://www.theses.fr/2012STET4003.

MLA Handbook (7th Edition):

Bellet, Aurélien. “Supervised metric learning with generalization guarantees : Apprentissage supervisé de métriques avec garanties en généralisation.” 2012. Web. 17 Nov 2017.

Vancouver:

Bellet A. Supervised metric learning with generalization guarantees : Apprentissage supervisé de métriques avec garanties en généralisation. [Internet] [Doctoral dissertation]. Saint-Etienne; 2012. [cited 2017 Nov 17]. Available from: http://www.theses.fr/2012STET4003.

Council of Science Editors:

Bellet A. Supervised metric learning with generalization guarantees : Apprentissage supervisé de métriques avec garanties en généralisation. [Doctoral Dissertation]. Saint-Etienne; 2012. Available from: http://www.theses.fr/2012STET4003

19. Mori, Tomoya. Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology .

Degree: 2015, Kyoto University

Subjects/Keywords: tree-structured data; tree edit distance; tree inclusion; dynamic programming; computational biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mori, T. (2015). Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/202741

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

Mori, Tomoya. “Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology .” 2015. Thesis, Kyoto University. Accessed November 17, 2017. http://hdl.handle.net/2433/202741.

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

MLA Handbook (7th Edition):

Mori, Tomoya. “Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology .” 2015. Web. 17 Nov 2017.

Vancouver:

Mori T. Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology . [Internet] [Thesis]. Kyoto University; 2015. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/2433/202741.

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

Council of Science Editors:

Mori T. Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology . [Thesis]. Kyoto University; 2015. Available from: http://hdl.handle.net/2433/202741

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

20. Hyyrö, Heikki. Practical Methods for Approximate String Matching .

Degree: 2003, U of Tampere : Diss

 Merkkijonohaku tarkoittaa hakusanan esiintymien etsimistä tekstistä. Tällainen toiminto on yleinen esimerkiksi tekstinkäsittelyohjelmissa tai tietokantahauissa. Varsinkin tietokantahauissa käytetään usein indeksoitua merkkijonohakua, jossa haku saadaan tehtyä hyvin… (more)

Subjects/Keywords: Editointietäisyys; likimääräinen merkkijonohaku; likimääräinen hahmontunnistus; Edit distance; approximate string matching; approximate pattern matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hyyrö, H. (2003). Practical Methods for Approximate String Matching . (Doctoral Dissertation). U of Tampere : Diss. Retrieved from http://tampub.uta.fi/handle/10024/67325

Chicago Manual of Style (16th Edition):

Hyyrö, Heikki. “Practical Methods for Approximate String Matching .” 2003. Doctoral Dissertation, U of Tampere : Diss. Accessed November 17, 2017. http://tampub.uta.fi/handle/10024/67325.

MLA Handbook (7th Edition):

Hyyrö, Heikki. “Practical Methods for Approximate String Matching .” 2003. Web. 17 Nov 2017.

Vancouver:

Hyyrö H. Practical Methods for Approximate String Matching . [Internet] [Doctoral dissertation]. U of Tampere : Diss; 2003. [cited 2017 Nov 17]. Available from: http://tampub.uta.fi/handle/10024/67325.

Council of Science Editors:

Hyyrö H. Practical Methods for Approximate String Matching . [Doctoral Dissertation]. U of Tampere : Diss; 2003. Available from: http://tampub.uta.fi/handle/10024/67325

21. Mallmann, Rafael Mendes. Arquiteturas em hardware para o alinhamento local de sequências biológicas.

Degree: 2010, Universidade do Rio Grande do Sul

Bancos de dados biológicos utilizados para comparação e alinhamento local de sequências tem crescido de forma exponencial. Isso popularizou programas que realizam buscas nesses bancos.… (more)

Subjects/Keywords: Microeletrônica; DNA sequence scanning; Aplicação dos computadores; Smith-Waterman; Edit distanve; Levenshtein distance; Dynamic programming; Systolic array; FPGA; ASIC; VLSI; Protein sequences; Query sequence; Subject sequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mallmann, R. M. (2010). Arquiteturas em hardware para o alinhamento local de sequências biológicas. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/56841

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

Mallmann, Rafael Mendes. “Arquiteturas em hardware para o alinhamento local de sequências biológicas.” 2010. Thesis, Universidade do Rio Grande do Sul. Accessed November 17, 2017. http://hdl.handle.net/10183/56841.

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

MLA Handbook (7th Edition):

Mallmann, Rafael Mendes. “Arquiteturas em hardware para o alinhamento local de sequências biológicas.” 2010. Web. 17 Nov 2017.

Vancouver:

Mallmann RM. Arquiteturas em hardware para o alinhamento local de sequências biológicas. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2010. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/10183/56841.

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

Council of Science Editors:

Mallmann RM. Arquiteturas em hardware para o alinhamento local de sequências biológicas. [Thesis]. Universidade do Rio Grande do Sul; 2010. Available from: http://hdl.handle.net/10183/56841

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

22. Schulz, Drew. PiaNote: A Sight-Reading Program That Algorithmically Generates Music Based on Human Performance.

Degree: MS, Computer Science, 2016, Cal Poly

  Sight-reading is the act of performing a piece of music at first sight. This can be a difficult task to master, because it requires… (more)

Subjects/Keywords: music; piano; algorithm; edit-distance; sight-reading; AI; Music Education

…40 5.1.4.3 Calculating Edit-Distance . . . . . . . . . . . . . . . 40 5.1.4.4 Edit… …32nd note. . . . . . . 9 5.1 Match scores for edit distance calculations. The score for… …37 5.3 Edit-distance alignment of two strings, “balloon” and “saloon”. . . 39 5.4 A… …Distance and Alignment . . . . . . . . . . . . . 42 5.1.5 Difficulty in Measuring Note… …historical reasons not discussed in this thesis. The tonal distance between pitch classes is known… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schulz, D. (2016). PiaNote: A Sight-Reading Program That Algorithmically Generates Music Based on Human Performance. (Masters Thesis). Cal Poly. Retrieved from http://digitalcommons.calpoly.edu/theses/1579 ; 10.15368/theses.2016.53

Chicago Manual of Style (16th Edition):

Schulz, Drew. “PiaNote: A Sight-Reading Program That Algorithmically Generates Music Based on Human Performance.” 2016. Masters Thesis, Cal Poly. Accessed November 17, 2017. http://digitalcommons.calpoly.edu/theses/1579 ; 10.15368/theses.2016.53.

MLA Handbook (7th Edition):

Schulz, Drew. “PiaNote: A Sight-Reading Program That Algorithmically Generates Music Based on Human Performance.” 2016. Web. 17 Nov 2017.

Vancouver:

Schulz D. PiaNote: A Sight-Reading Program That Algorithmically Generates Music Based on Human Performance. [Internet] [Masters thesis]. Cal Poly; 2016. [cited 2017 Nov 17]. Available from: http://digitalcommons.calpoly.edu/theses/1579 ; 10.15368/theses.2016.53.

Council of Science Editors:

Schulz D. PiaNote: A Sight-Reading Program That Algorithmically Generates Music Based on Human Performance. [Masters Thesis]. Cal Poly; 2016. Available from: http://digitalcommons.calpoly.edu/theses/1579 ; 10.15368/theses.2016.53


Kyoto University / 京都大学

23. Mori, Tomoya. Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology : 木構造データの解析手法とその計算生物学への応用.

Degree: 博士(情報学), 2015, Kyoto University / 京都大学

新制・課程博士

甲第19336号

情博第588号

Subjects/Keywords: tree-structured data; tree edit distance; tree inclusion; dynamic programming; computational biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mori, T. (2015). Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology : 木構造データの解析手法とその計算生物学への応用. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/202741 ; http://dx.doi.org/10.14989/doctor.k19336

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

Mori, Tomoya. “Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology : 木構造データの解析手法とその計算生物学への応用.” 2015. Thesis, Kyoto University / 京都大学. Accessed November 17, 2017. http://hdl.handle.net/2433/202741 ; http://dx.doi.org/10.14989/doctor.k19336.

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

MLA Handbook (7th Edition):

Mori, Tomoya. “Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology : 木構造データの解析手法とその計算生物学への応用.” 2015. Web. 17 Nov 2017.

Vancouver:

Mori T. Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology : 木構造データの解析手法とその計算生物学への応用. [Internet] [Thesis]. Kyoto University / 京都大学; 2015. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/2433/202741 ; http://dx.doi.org/10.14989/doctor.k19336.

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

Council of Science Editors:

Mori T. Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology : 木構造データの解析手法とその計算生物学への応用. [Thesis]. Kyoto University / 京都大学; 2015. Available from: http://hdl.handle.net/2433/202741 ; http://dx.doi.org/10.14989/doctor.k19336

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

24. Abu-Aisheh, Zeina. Approches anytime et distribuées pour l'appariment de graphes : Anytime and distributed approaches for graph matching.

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

En raison de la capacité et de l'amélioration des performances informatiques, les représentations structurelles sont devenues de plus en plus populaires dans le domaine de… (more)

Subjects/Keywords: Reconnaissance de formes; Appariement de graphes; Distance d'édition; Branch-and-Bound; Systèmes parallèle et distribué; Équilibrage de charge; Évaluation de performance; Contraintes de temps; Pattern Recognition; Graph Matching; Graph Edit Distance; Branchand-Bound; Distributed and Parallel Systems; Load Balancing; Performance Evaluation Metrics; Anytime Graph Matching; Time Constraints

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abu-Aisheh, Z. (2016). Approches anytime et distribuées pour l'appariment de graphes : Anytime and distributed approaches for graph matching. (Doctoral Dissertation). Université François-Rabelais de Tours. Retrieved from http://www.theses.fr/2016TOUR4024

Chicago Manual of Style (16th Edition):

Abu-Aisheh, Zeina. “Approches anytime et distribuées pour l'appariment de graphes : Anytime and distributed approaches for graph matching.” 2016. Doctoral Dissertation, Université François-Rabelais de Tours. Accessed November 17, 2017. http://www.theses.fr/2016TOUR4024.

MLA Handbook (7th Edition):

Abu-Aisheh, Zeina. “Approches anytime et distribuées pour l'appariment de graphes : Anytime and distributed approaches for graph matching.” 2016. Web. 17 Nov 2017.

Vancouver:

Abu-Aisheh Z. Approches anytime et distribuées pour l'appariment de graphes : Anytime and distributed approaches for graph matching. [Internet] [Doctoral dissertation]. Université François-Rabelais de Tours; 2016. [cited 2017 Nov 17]. Available from: http://www.theses.fr/2016TOUR4024.

Council of Science Editors:

Abu-Aisheh Z. Approches anytime et distribuées pour l'appariment de graphes : Anytime and distributed approaches for graph matching. [Doctoral Dissertation]. Université François-Rabelais de Tours; 2016. Available from: http://www.theses.fr/2016TOUR4024


Université Paris-Sud – Paris XI

25. Cao, Phuong Thao. Approximation of OLAP queries on data warehouses : Approximation aux requêtes OLAP sur les entrepôts de données.

Degree: Docteur es, Informatique, 2013, Université Paris-Sud – Paris XI

Nous étudions les réponses proches à des requêtes OLAP sur les entrepôts de données. Nous considérons les réponses relatives aux requêtes OLAP sur un schéma,… (more)

Subjects/Keywords: OLAP; Réponses proches de la requête; Échange de données OLAP; Flux de données; Distance d'édition; Algorithme d'échantillonnage; Dépendances statistiques; Modèle statistique; OLAP; Approximate query answering; OLAP data exchange; Streaming data; Edit distance; Sampling algorithm; Statistical dependencies; Statistical model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cao, P. T. (2013). Approximation of OLAP queries on data warehouses : Approximation aux requêtes OLAP sur les entrepôts de données. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2013PA112091

Chicago Manual of Style (16th Edition):

Cao, Phuong Thao. “Approximation of OLAP queries on data warehouses : Approximation aux requêtes OLAP sur les entrepôts de données.” 2013. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed November 17, 2017. http://www.theses.fr/2013PA112091.

MLA Handbook (7th Edition):

Cao, Phuong Thao. “Approximation of OLAP queries on data warehouses : Approximation aux requêtes OLAP sur les entrepôts de données.” 2013. Web. 17 Nov 2017.

Vancouver:

Cao PT. Approximation of OLAP queries on data warehouses : Approximation aux requêtes OLAP sur les entrepôts de données. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2017 Nov 17]. Available from: http://www.theses.fr/2013PA112091.

Council of Science Editors:

Cao PT. Approximation of OLAP queries on data warehouses : Approximation aux requêtes OLAP sur les entrepôts de données. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2013. Available from: http://www.theses.fr/2013PA112091

26. Madi, Kamel. Inexact graph matching : application to 2D and 3D Pattern Recognition : Appariement inexact de graphes : application à la reconnaissance de formes 2D et 3D.

Degree: Docteur es, Informatique, 2016, Lyon

 Les Graphes sont des structures mathématiques puissantes constituant un outil de modélisation universel utilisé dans différents domaines de l'informatique, notamment dans le domaine de la… (more)

Subjects/Keywords: Appariement de graphes; Distance d’édition de graphes; Décomposition de graphes; Modélisation à base de graphes; Reconnaissance de formes; Reconnaissance d’objets 3D; Reconnaissance d’objets déformables; Kites; Graph matching; Graph edit distance; Graph decomposition; Graph based modelling; Pattern recognition; 3D object recognition; Deformable object recognition; Kites; 006.4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Madi, K. (2016). Inexact graph matching : application to 2D and 3D Pattern Recognition : Appariement inexact de graphes : application à la reconnaissance de formes 2D et 3D. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2016LYSE1315

Chicago Manual of Style (16th Edition):

Madi, Kamel. “Inexact graph matching : application to 2D and 3D Pattern Recognition : Appariement inexact de graphes : application à la reconnaissance de formes 2D et 3D.” 2016. Doctoral Dissertation, Lyon. Accessed November 17, 2017. http://www.theses.fr/2016LYSE1315.

MLA Handbook (7th Edition):

Madi, Kamel. “Inexact graph matching : application to 2D and 3D Pattern Recognition : Appariement inexact de graphes : application à la reconnaissance de formes 2D et 3D.” 2016. Web. 17 Nov 2017.

Vancouver:

Madi K. Inexact graph matching : application to 2D and 3D Pattern Recognition : Appariement inexact de graphes : application à la reconnaissance de formes 2D et 3D. [Internet] [Doctoral dissertation]. Lyon; 2016. [cited 2017 Nov 17]. Available from: http://www.theses.fr/2016LYSE1315.

Council of Science Editors:

Madi K. Inexact graph matching : application to 2D and 3D Pattern Recognition : Appariement inexact de graphes : application à la reconnaissance de formes 2D et 3D. [Doctoral Dissertation]. Lyon; 2016. Available from: http://www.theses.fr/2016LYSE1315

27. Bui, Quang Anh. Vers un système omni-langage de recherche de mots dans des bases de documents écrits homogènes : Towards an omni-language word retrieval system applied in homogeneous document collections.

Degree: Docteur es, Informatique et applications, 2015, La Rochelle

Notre thèse a pour objectif la construction d’un système omni-langage de recherche de mots dans les documents numérisés. Nous nous plaçons dans le contexte où… (more)

Subjects/Keywords: Système de recherche de mots; Composition des requêtes; Extraction de strokes; Invariants; Représentation basée sur graphe; Distance d’édition de graphes; Word retrieval system; Request composition; Stroke extraction; Invariants; Graph-based representation; Graph edit distance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bui, Q. A. (2015). Vers un système omni-langage de recherche de mots dans des bases de documents écrits homogènes : Towards an omni-language word retrieval system applied in homogeneous document collections. (Doctoral Dissertation). La Rochelle. Retrieved from http://www.theses.fr/2015LAROS010

Chicago Manual of Style (16th Edition):

Bui, Quang Anh. “Vers un système omni-langage de recherche de mots dans des bases de documents écrits homogènes : Towards an omni-language word retrieval system applied in homogeneous document collections.” 2015. Doctoral Dissertation, La Rochelle. Accessed November 17, 2017. http://www.theses.fr/2015LAROS010.

MLA Handbook (7th Edition):

Bui, Quang Anh. “Vers un système omni-langage de recherche de mots dans des bases de documents écrits homogènes : Towards an omni-language word retrieval system applied in homogeneous document collections.” 2015. Web. 17 Nov 2017.

Vancouver:

Bui QA. Vers un système omni-langage de recherche de mots dans des bases de documents écrits homogènes : Towards an omni-language word retrieval system applied in homogeneous document collections. [Internet] [Doctoral dissertation]. La Rochelle; 2015. [cited 2017 Nov 17]. Available from: http://www.theses.fr/2015LAROS010.

Council of Science Editors:

Bui QA. Vers un système omni-langage de recherche de mots dans des bases de documents écrits homogènes : Towards an omni-language word retrieval system applied in homogeneous document collections. [Doctoral Dissertation]. La Rochelle; 2015. Available from: http://www.theses.fr/2015LAROS010

28. Amavi, Joshua. Comparaison et évolution de schémas XML : Comparison and evolution of XML schema.

Degree: Docteur es, Informatique, 2014, Université d'Orléans

XML est devenu le format standard d’échange de données. Nous souhaitons construire un environnement multi-système où des systèmes locaux travaillent en harmonie avec un système… (more)

Subjects/Keywords: XML; Grammaire de haies; Dépendances fonctionnelles; Interopérabilité; Mapping de schémas; Echanges de données; Inclusion relâchée; Correction de documents en fonction d’un schéma; Distance d’édition d’arbres; XML; Regular unranked-tree grammar; Functional dependency; Interoperability; Schema mapping; Data exchange; Approximative inclusion; Document-to-schema correction; Tree edit distance; 005.71

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Amavi, J. (2014). Comparaison et évolution de schémas XML : Comparison and evolution of XML schema. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2014ORLE2053

Chicago Manual of Style (16th Edition):

Amavi, Joshua. “Comparaison et évolution de schémas XML : Comparison and evolution of XML schema.” 2014. Doctoral Dissertation, Université d'Orléans. Accessed November 17, 2017. http://www.theses.fr/2014ORLE2053.

MLA Handbook (7th Edition):

Amavi, Joshua. “Comparaison et évolution de schémas XML : Comparison and evolution of XML schema.” 2014. Web. 17 Nov 2017.

Vancouver:

Amavi J. Comparaison et évolution de schémas XML : Comparison and evolution of XML schema. [Internet] [Doctoral dissertation]. Université d'Orléans; 2014. [cited 2017 Nov 17]. Available from: http://www.theses.fr/2014ORLE2053.

Council of Science Editors:

Amavi J. Comparaison et évolution de schémas XML : Comparison and evolution of XML schema. [Doctoral Dissertation]. Université d'Orléans; 2014. Available from: http://www.theses.fr/2014ORLE2053


Brno University of Technology

29. Bým, Ondřej. Klientská část systému pro správu projektové dokumentace .

Degree: 2008, Brno University of Technology

 Cílem této práce je navrhnout obecně použitelný verzovací systém pro správu elektronických dokumentů různých typů, detailněji navrhnout a implementovat klientskou část tohoto systému (založeném na… (more)

Subjects/Keywords: verzovací systém; verzování; správa verzí; verze souboru; revize souboru; LCS; nejdelší společná podposloupnost; problém vzdálenosti změn; XML serializace .NET; pracovní prostor verzovacího systému; versioning system; versioning; revision control; file version; file revision; LCS;   longest common subsequence; edit distance problem; XML .NET serialization; version system working space

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bým, O. (2008). Klientská část systému pro správu projektové dokumentace . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53189

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

Bým, Ondřej. “Klientská část systému pro správu projektové dokumentace .” 2008. Thesis, Brno University of Technology. Accessed November 17, 2017. http://hdl.handle.net/11012/53189.

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

MLA Handbook (7th Edition):

Bým, Ondřej. “Klientská část systému pro správu projektové dokumentace .” 2008. Web. 17 Nov 2017.

Vancouver:

Bým O. Klientská část systému pro správu projektové dokumentace . [Internet] [Thesis]. Brno University of Technology; 2008. [cited 2017 Nov 17]. Available from: http://hdl.handle.net/11012/53189.

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

Council of Science Editors:

Bým O. Klientská část systému pro správu projektové dokumentace . [Thesis]. Brno University of Technology; 2008. Available from: http://hdl.handle.net/11012/53189

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

30. Araujo, Francisco Eloi Soares de. Alinhamentos e comparação de sequências.

Degree: PhD, Ciência da Computação, 2012, University of São Paulo

A comparação de sequências finitas é uma ferramenta que é utilizada para a solução de problemas em várias áreas. Comparamos sequências inferindo quais são as… (more)

Subjects/Keywords: alinhamento de sequências; alinhamento de várias sequências.; alinhamento estendido; custo normalizado de alinhamentos; distância de edição; edit distance; equivalent matrices; extended alignment; matrizes equivalentes; metric; métrica; multiple sequence alignments.; normalized alignment cost; sequence alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Araujo, F. E. S. d. (2012). Alinhamentos e comparação de sequências. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12092012-230830/ ;

Chicago Manual of Style (16th Edition):

Araujo, Francisco Eloi Soares de. “Alinhamentos e comparação de sequências.” 2012. Doctoral Dissertation, University of São Paulo. Accessed November 17, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12092012-230830/ ;.

MLA Handbook (7th Edition):

Araujo, Francisco Eloi Soares de. “Alinhamentos e comparação de sequências.” 2012. Web. 17 Nov 2017.

Vancouver:

Araujo FESd. Alinhamentos e comparação de sequências. [Internet] [Doctoral dissertation]. University of São Paulo; 2012. [cited 2017 Nov 17]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12092012-230830/ ;.

Council of Science Editors:

Araujo FESd. Alinhamentos e comparação de sequências. [Doctoral Dissertation]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12092012-230830/ ;

[1] [2]

.