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:( Matching algorithms). Showing records 1 – 30 of 75 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Levels

▼ Search Limiters


University of Nairobi

1. Njeru, Silas K. A comparative study of minutiae based fingerprint matching algorithms .

Degree: 2015, University of Nairobi

 The fingerprint recognition has been used widely in cross border identification, criminal investigation, access control and paternity identification among other modern identification and authentication systems.… (more)

Subjects/Keywords: Fingerprint Matching Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Njeru, S. K. (2015). A comparative study of minutiae based fingerprint matching algorithms . (Thesis). University of Nairobi. Retrieved from http://hdl.handle.net/11295/97309

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

Njeru, Silas K. “A comparative study of minutiae based fingerprint matching algorithms .” 2015. Thesis, University of Nairobi. Accessed January 29, 2020. http://hdl.handle.net/11295/97309.

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

MLA Handbook (7th Edition):

Njeru, Silas K. “A comparative study of minutiae based fingerprint matching algorithms .” 2015. Web. 29 Jan 2020.

Vancouver:

Njeru SK. A comparative study of minutiae based fingerprint matching algorithms . [Internet] [Thesis]. University of Nairobi; 2015. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/11295/97309.

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

Council of Science Editors:

Njeru SK. A comparative study of minutiae based fingerprint matching algorithms . [Thesis]. University of Nairobi; 2015. Available from: http://hdl.handle.net/11295/97309

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


Cornell University

2. Rojas, Christopher. Three Essays on Network Effects in Online Social Networks .

Degree: 2019, Cornell University

 In my dissertation, I focus on estimating network effects in online social networks, using observational data. In the first chapter of my dissertation, coauthored with… (more)

Subjects/Keywords: Dynamic Networks; Matching Algorithms; machine learning; Economics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rojas, C. (2019). Three Essays on Network Effects in Online Social Networks . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/67595

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

Rojas, Christopher. “Three Essays on Network Effects in Online Social Networks .” 2019. Thesis, Cornell University. Accessed January 29, 2020. http://hdl.handle.net/1813/67595.

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

MLA Handbook (7th Edition):

Rojas, Christopher. “Three Essays on Network Effects in Online Social Networks .” 2019. Web. 29 Jan 2020.

Vancouver:

Rojas C. Three Essays on Network Effects in Online Social Networks . [Internet] [Thesis]. Cornell University; 2019. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/1813/67595.

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

Council of Science Editors:

Rojas C. Three Essays on Network Effects in Online Social Networks . [Thesis]. Cornell University; 2019. Available from: http://hdl.handle.net/1813/67595

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


University of Edinburgh

3. Horna Carranza, Luis Alberto. Specialised global methods for binocular and trinocular stereo matching.

Degree: PhD, 2017, University of Edinburgh

 The problem of estimating depth from two or more images is a fundamental problem in computer vision, which is commonly referred as to stereo matching.… (more)

Subjects/Keywords: depth estimation; stereo matching; binocular stereo matching algorithm; 3D; trinocular; trinocular algorithms; binocular algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Horna Carranza, L. A. (2017). Specialised global methods for binocular and trinocular stereo matching. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/29017

Chicago Manual of Style (16th Edition):

Horna Carranza, Luis Alberto. “Specialised global methods for binocular and trinocular stereo matching.” 2017. Doctoral Dissertation, University of Edinburgh. Accessed January 29, 2020. http://hdl.handle.net/1842/29017.

MLA Handbook (7th Edition):

Horna Carranza, Luis Alberto. “Specialised global methods for binocular and trinocular stereo matching.” 2017. Web. 29 Jan 2020.

Vancouver:

Horna Carranza LA. Specialised global methods for binocular and trinocular stereo matching. [Internet] [Doctoral dissertation]. University of Edinburgh; 2017. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/1842/29017.

Council of Science Editors:

Horna Carranza LA. Specialised global methods for binocular and trinocular stereo matching. [Doctoral Dissertation]. University of Edinburgh; 2017. Available from: http://hdl.handle.net/1842/29017


Penn State University

4. Li, Zhenyao. Greedy Algorithm for approximating maximum induced matching.

Degree: MS, Computer Science and Engineering, 2014, Penn State University

 An induced matching in a graph G=(V,E) is M\subseteq E such that it is a matching and also the edge set of an induced subgraph… (more)

Subjects/Keywords: graph theory; combinatorial problem; approximation algorithms; induced matching; greedy algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Z. (2014). Greedy Algorithm for approximating maximum induced matching. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/22793

Chicago Manual of Style (16th Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Masters Thesis, Penn State University. Accessed January 29, 2020. https://etda.libraries.psu.edu/catalog/22793.

MLA Handbook (7th Edition):

Li, Zhenyao. “Greedy Algorithm for approximating maximum induced matching.” 2014. Web. 29 Jan 2020.

Vancouver:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2020 Jan 29]. Available from: https://etda.libraries.psu.edu/catalog/22793.

Council of Science Editors:

Li Z. Greedy Algorithm for approximating maximum induced matching. [Masters Thesis]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/22793


University of Newcastle

5. Ang, Kim Siang. Robust non-rigid surface matching and its application to scoliosis modelling.

Degree: PhD, 2010, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

With the advancement of digital photogrammetry techniques, development of digital surface topographies becomes easier and straightforward, leading to… (more)

Subjects/Keywords: digital photogrammetry; surface topographies; scoliosis; non-rigid surface matching; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ang, K. S. (2010). Robust non-rigid surface matching and its application to scoliosis modelling. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/805653

Chicago Manual of Style (16th Edition):

Ang, Kim Siang. “Robust non-rigid surface matching and its application to scoliosis modelling.” 2010. Doctoral Dissertation, University of Newcastle. Accessed January 29, 2020. http://hdl.handle.net/1959.13/805653.

MLA Handbook (7th Edition):

Ang, Kim Siang. “Robust non-rigid surface matching and its application to scoliosis modelling.” 2010. Web. 29 Jan 2020.

Vancouver:

Ang KS. Robust non-rigid surface matching and its application to scoliosis modelling. [Internet] [Doctoral dissertation]. University of Newcastle; 2010. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/1959.13/805653.

Council of Science Editors:

Ang KS. Robust non-rigid surface matching and its application to scoliosis modelling. [Doctoral Dissertation]. University of Newcastle; 2010. Available from: http://hdl.handle.net/1959.13/805653


Clemson University

6. Dabney, John. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems.

Degree: PhD, Computer Science, 2010, Clemson University

 In this dissertation we focus on different variations of the stable matching (marriage) problem, initially posed by Gale and Shapley in 1962. In this problem,… (more)

Subjects/Keywords: Adaptive algorithms; heuristics; Stable marriage; Stable matching; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dabney, J. (2010). Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/664

Chicago Manual of Style (16th Edition):

Dabney, John. “Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems.” 2010. Doctoral Dissertation, Clemson University. Accessed January 29, 2020. https://tigerprints.clemson.edu/all_dissertations/664.

MLA Handbook (7th Edition):

Dabney, John. “Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems.” 2010. Web. 29 Jan 2020.

Vancouver:

Dabney J. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. [Internet] [Doctoral dissertation]. Clemson University; 2010. [cited 2020 Jan 29]. Available from: https://tigerprints.clemson.edu/all_dissertations/664.

Council of Science Editors:

Dabney J. Batch Testing, Adaptive Algorithms, and Heuristic Applications for Stable Marriage Problems. [Doctoral Dissertation]. Clemson University; 2010. Available from: https://tigerprints.clemson.edu/all_dissertations/664


Utah State University

7. Guerrero, Maridalia. A Comparative Study of Three Image Matcing Algorithms: Sift, Surf, and Fast.

Degree: MS, Civil and Environmental Engineering, 2011, Utah State University

  A new method for assessing the performance of popular image matching algorithms is presented. Specifically, the method assesses the type of images under which… (more)

Subjects/Keywords: Image Matching Algorithms; Comparative Study; Civil and Environmental Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guerrero, M. (2011). A Comparative Study of Three Image Matcing Algorithms: Sift, Surf, and Fast. (Masters Thesis). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/1040

Chicago Manual of Style (16th Edition):

Guerrero, Maridalia. “A Comparative Study of Three Image Matcing Algorithms: Sift, Surf, and Fast.” 2011. Masters Thesis, Utah State University. Accessed January 29, 2020. https://digitalcommons.usu.edu/etd/1040.

MLA Handbook (7th Edition):

Guerrero, Maridalia. “A Comparative Study of Three Image Matcing Algorithms: Sift, Surf, and Fast.” 2011. Web. 29 Jan 2020.

Vancouver:

Guerrero M. A Comparative Study of Three Image Matcing Algorithms: Sift, Surf, and Fast. [Internet] [Masters thesis]. Utah State University; 2011. [cited 2020 Jan 29]. Available from: https://digitalcommons.usu.edu/etd/1040.

Council of Science Editors:

Guerrero M. A Comparative Study of Three Image Matcing Algorithms: Sift, Surf, and Fast. [Masters Thesis]. Utah State University; 2011. Available from: https://digitalcommons.usu.edu/etd/1040

8. Li, Franck. Lane-level vehicle localization with integrity monitoring for data aggregation : Estimation intègre par les véhicules de leur voie de circulation pour l’agrégation de données.

Degree: Docteur es, Robotique : Unité de recherche Heudyasic (UMR-7253), 2018, Compiègne

 Les informations contenues dans les cartes routières numériques revêtent une importance grandissante dans le domaine des véhicules intelligents. La prise en compte d’environnements de plus… (more)

Subjects/Keywords: Map-matching; Filtre particulaire; Cartes routières numériques; Capteurs embarqués; Intelligent vehicles; Map-matching; Localization; Particle filter; Learning map; Algorithms; Sensors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, F. (2018). Lane-level vehicle localization with integrity monitoring for data aggregation : Estimation intègre par les véhicules de leur voie de circulation pour l’agrégation de données. (Doctoral Dissertation). Compiègne. Retrieved from http://www.theses.fr/2018COMP2458

Chicago Manual of Style (16th Edition):

Li, Franck. “Lane-level vehicle localization with integrity monitoring for data aggregation : Estimation intègre par les véhicules de leur voie de circulation pour l’agrégation de données.” 2018. Doctoral Dissertation, Compiègne. Accessed January 29, 2020. http://www.theses.fr/2018COMP2458.

MLA Handbook (7th Edition):

Li, Franck. “Lane-level vehicle localization with integrity monitoring for data aggregation : Estimation intègre par les véhicules de leur voie de circulation pour l’agrégation de données.” 2018. Web. 29 Jan 2020.

Vancouver:

Li F. Lane-level vehicle localization with integrity monitoring for data aggregation : Estimation intègre par les véhicules de leur voie de circulation pour l’agrégation de données. [Internet] [Doctoral dissertation]. Compiègne; 2018. [cited 2020 Jan 29]. Available from: http://www.theses.fr/2018COMP2458.

Council of Science Editors:

Li F. Lane-level vehicle localization with integrity monitoring for data aggregation : Estimation intègre par les véhicules de leur voie de circulation pour l’agrégation de données. [Doctoral Dissertation]. Compiègne; 2018. Available from: http://www.theses.fr/2018COMP2458


Indian Institute of Science

9. Nasre, Meghana. Generalizations Of The Popular Matching Problem.

Degree: 2011, Indian Institute of Science

Matching problems arise in several real-world scenarios like assigning posts to applicants, houses to trainees and room-mates to one another. In this thesis we consider… (more)

Subjects/Keywords: Matching Algorithms; Bipartite Matching; Popular Matchings; Unpopular Matchings; Computing Matchings; Popular Mixed Matchings; Bounded Unpopularity Matchings; Optimal Popular Matchings; Popular Matchings; Matching Problems; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nasre, M. (2011). Generalizations Of The Popular Matching Problem. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2095

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

Nasre, Meghana. “Generalizations Of The Popular Matching Problem.” 2011. Thesis, Indian Institute of Science. Accessed January 29, 2020. http://hdl.handle.net/2005/2095.

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

MLA Handbook (7th Edition):

Nasre, Meghana. “Generalizations Of The Popular Matching Problem.” 2011. Web. 29 Jan 2020.

Vancouver:

Nasre M. Generalizations Of The Popular Matching Problem. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/2005/2095.

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

Council of Science Editors:

Nasre M. Generalizations Of The Popular Matching Problem. [Thesis]. Indian Institute of Science; 2011. Available from: http://hdl.handle.net/2005/2095

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


Indian Institute of Science

10. Nasre, Meghana. Generalizations Of The Popular Matching Problem.

Degree: 2011, Indian Institute of Science

Matching problems arise in several real-world scenarios like assigning posts to applicants, houses to trainees and room-mates to one another. In this thesis we consider… (more)

Subjects/Keywords: Matching Algorithms; Bipartite Matching; Popular Matchings; Unpopular Matchings; Computing Matchings; Popular Mixed Matchings; Bounded Unpopularity Matchings; Optimal Popular Matchings; Popular Matchings; Matching Problems; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nasre, M. (2011). Generalizations Of The Popular Matching Problem. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2095 ; http://etd.ncsi.iisc.ernet.in/abstracts/2696/G24924-Abs.pdf

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

Nasre, Meghana. “Generalizations Of The Popular Matching Problem.” 2011. Thesis, Indian Institute of Science. Accessed January 29, 2020. http://etd.iisc.ernet.in/handle/2005/2095 ; http://etd.ncsi.iisc.ernet.in/abstracts/2696/G24924-Abs.pdf.

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

MLA Handbook (7th Edition):

Nasre, Meghana. “Generalizations Of The Popular Matching Problem.” 2011. Web. 29 Jan 2020.

Vancouver:

Nasre M. Generalizations Of The Popular Matching Problem. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2020 Jan 29]. Available from: http://etd.iisc.ernet.in/handle/2005/2095 ; http://etd.ncsi.iisc.ernet.in/abstracts/2696/G24924-Abs.pdf.

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

Council of Science Editors:

Nasre M. Generalizations Of The Popular Matching Problem. [Thesis]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ernet.in/handle/2005/2095 ; http://etd.ncsi.iisc.ernet.in/abstracts/2696/G24924-Abs.pdf

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

11. Ricardo Lima Feitosa Ãvila. Emprego de tÃcnicas de prÃ-processamento textual e algoritmos de comparaÃÃo como suporte à correÃÃo de questÃes dissertativas: experimentos, anÃlises e contribuiÃÃes.

Degree: Master, 2013, Universidade Federal do Ceará

Esta dissertaÃÃo apresenta um estudo de tÃcnicas que podem ser empregadas como apoio para a correÃÃo de questÃes dissertativas com base na adaptaÃÃo de algoritmos… (more)

Subjects/Keywords: string-matching algorithms; Processamento de textos (ComputaÃÃo); ENGENHARIAS; TeleinformÃtica; plagiarism detection.; similarity; preprocessing texts

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ãvila, R. L. F. (2013). Emprego de tÃcnicas de prÃ-processamento textual e algoritmos de comparaÃÃo como suporte à correÃÃo de questÃes dissertativas: experimentos, anÃlises e contribuiÃÃes. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10572 ;

Chicago Manual of Style (16th Edition):

Ãvila, Ricardo Lima Feitosa. “Emprego de tÃcnicas de prÃ-processamento textual e algoritmos de comparaÃÃo como suporte à correÃÃo de questÃes dissertativas: experimentos, anÃlises e contribuiÃÃes.” 2013. Masters Thesis, Universidade Federal do Ceará. Accessed January 29, 2020. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10572 ;.

MLA Handbook (7th Edition):

Ãvila, Ricardo Lima Feitosa. “Emprego de tÃcnicas de prÃ-processamento textual e algoritmos de comparaÃÃo como suporte à correÃÃo de questÃes dissertativas: experimentos, anÃlises e contribuiÃÃes.” 2013. Web. 29 Jan 2020.

Vancouver:

Ãvila RLF. Emprego de tÃcnicas de prÃ-processamento textual e algoritmos de comparaÃÃo como suporte à correÃÃo de questÃes dissertativas: experimentos, anÃlises e contribuiÃÃes. [Internet] [Masters thesis]. Universidade Federal do Ceará 2013. [cited 2020 Jan 29]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10572 ;.

Council of Science Editors:

Ãvila RLF. Emprego de tÃcnicas de prÃ-processamento textual e algoritmos de comparaÃÃo como suporte à correÃÃo de questÃes dissertativas: experimentos, anÃlises e contribuiÃÃes. [Masters Thesis]. Universidade Federal do Ceará 2013. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10572 ;


Universidade Nova

12. Cruz, Paula Isabel Moura Meireles. Improving the matching of registered unemployed to job offers through machine learning algorithms.

Degree: 2017, Universidade Nova

 Due to the existence of a double-sided asymmetric information problem on the labour market characterized by a mutual lack of trust by employers and unemployed… (more)

Subjects/Keywords: Job matching; Registered Unemployed with PES; Machine learning algorithms; Social data; ESCO

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cruz, P. I. M. M. (2017). Improving the matching of registered unemployed to job offers through machine learning algorithms. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/20197

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

Cruz, Paula Isabel Moura Meireles. “Improving the matching of registered unemployed to job offers through machine learning algorithms.” 2017. Thesis, Universidade Nova. Accessed January 29, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/20197.

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

MLA Handbook (7th Edition):

Cruz, Paula Isabel Moura Meireles. “Improving the matching of registered unemployed to job offers through machine learning algorithms.” 2017. Web. 29 Jan 2020.

Vancouver:

Cruz PIMM. Improving the matching of registered unemployed to job offers through machine learning algorithms. [Internet] [Thesis]. Universidade Nova; 2017. [cited 2020 Jan 29]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/20197.

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

Council of Science Editors:

Cruz PIMM. Improving the matching of registered unemployed to job offers through machine learning algorithms. [Thesis]. Universidade Nova; 2017. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/20197

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


University of Oxford

13. Xiao, Zhuoling. Robust indoor positioning with lifelong learning.

Degree: PhD, 2014, University of Oxford

 Indoor tracking and navigation is a fundamental need for pervasive and context-aware applications. However, no practical and reliable indoor positioning solution is available at present.… (more)

Subjects/Keywords: 629.8; Applications and algorithms; Software engineering; Sensors; Robotics; positioning; dead reckoning; pattern matching; lifelong learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiao, Z. (2014). Robust indoor positioning with lifelong learning. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:218283f1-e28a-4ad0-9637-e2acd67ec394 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.647655

Chicago Manual of Style (16th Edition):

Xiao, Zhuoling. “Robust indoor positioning with lifelong learning.” 2014. Doctoral Dissertation, University of Oxford. Accessed January 29, 2020. http://ora.ox.ac.uk/objects/uuid:218283f1-e28a-4ad0-9637-e2acd67ec394 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.647655.

MLA Handbook (7th Edition):

Xiao, Zhuoling. “Robust indoor positioning with lifelong learning.” 2014. Web. 29 Jan 2020.

Vancouver:

Xiao Z. Robust indoor positioning with lifelong learning. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2020 Jan 29]. Available from: http://ora.ox.ac.uk/objects/uuid:218283f1-e28a-4ad0-9637-e2acd67ec394 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.647655.

Council of Science Editors:

Xiao Z. Robust indoor positioning with lifelong learning. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:218283f1-e28a-4ad0-9637-e2acd67ec394 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.647655


University of Illinois – Chicago

14. Hardwick, John. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.

Degree: 2017, University of Illinois – Chicago

 In cooperative game theory, the class of assignment games models a hypothetical market with two groups of people (for instance, buyers and sellers, or men… (more)

Subjects/Keywords: game theory; cooperative game theory; nucleolus; assignment game; matching; graph theory; directed graph; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hardwick, J. (2017). Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21740

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

Hardwick, John. “Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.” 2017. Thesis, University of Illinois – Chicago. Accessed January 29, 2020. http://hdl.handle.net/10027/21740.

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

MLA Handbook (7th Edition):

Hardwick, John. “Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games.” 2017. Web. 29 Jan 2020.

Vancouver:

Hardwick J. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/10027/21740.

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

Council of Science Editors:

Hardwick J. Graphical Algorithms for Finding the Nucleolus of Binary-Valued Matching Games. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21740

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


Brno University of Technology

15. Magdolen, Matej. Modifikace genetických algoritmů pro návrh celulárních automatů .

Degree: 2015, Brno University of Technology

 Tato práce se zabývá evolučním návrhem přechodové funkce celulárního automatu řešícího zvolenou úlohu. Jsou v ní popsány celulární automaty, evoluční algoritmy a alternativní forma zápisu… (more)

Subjects/Keywords: celulární automaty; genetické algoritmy; modifikace; podmínková pravidla; cellular automata; genetic algorithms; modification; conditionally matching rules

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Magdolen, M. (2015). Modifikace genetických algoritmů pro návrh celulárních automatů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52552

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

Magdolen, Matej. “Modifikace genetických algoritmů pro návrh celulárních automatů .” 2015. Thesis, Brno University of Technology. Accessed January 29, 2020. http://hdl.handle.net/11012/52552.

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

MLA Handbook (7th Edition):

Magdolen, Matej. “Modifikace genetických algoritmů pro návrh celulárních automatů .” 2015. Web. 29 Jan 2020.

Vancouver:

Magdolen M. Modifikace genetických algoritmů pro návrh celulárních automatů . [Internet] [Thesis]. Brno University of Technology; 2015. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/11012/52552.

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

Council of Science Editors:

Magdolen M. Modifikace genetických algoritmů pro návrh celulárních automatů . [Thesis]. Brno University of Technology; 2015. Available from: http://hdl.handle.net/11012/52552

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


Hong Kong University of Science and Technology

16. Fok, Yiu-hung. Fast feature-based motion estimation algorithms.

Degree: 1994, Hong Kong University of Science and Technology

 In order to cope with the extremely large amount of raw video data for the purpose of transmission and storage, compression is needed to reduce… (more)

Subjects/Keywords: Computer algorithms ; Video compression ; Matching theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fok, Y. (1994). Fast feature-based motion estimation algorithms. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-4378 ; https://doi.org/10.14711/thesis-b447445 ; http://repository.ust.hk/ir/bitstream/1783.1-4378/1/th_redirect.html

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

Fok, Yiu-hung. “Fast feature-based motion estimation algorithms.” 1994. Thesis, Hong Kong University of Science and Technology. Accessed January 29, 2020. http://repository.ust.hk/ir/Record/1783.1-4378 ; https://doi.org/10.14711/thesis-b447445 ; http://repository.ust.hk/ir/bitstream/1783.1-4378/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Fok, Yiu-hung. “Fast feature-based motion estimation algorithms.” 1994. Web. 29 Jan 2020.

Vancouver:

Fok Y. Fast feature-based motion estimation algorithms. [Internet] [Thesis]. Hong Kong University of Science and Technology; 1994. [cited 2020 Jan 29]. Available from: http://repository.ust.hk/ir/Record/1783.1-4378 ; https://doi.org/10.14711/thesis-b447445 ; http://repository.ust.hk/ir/bitstream/1783.1-4378/1/th_redirect.html.

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

Council of Science Editors:

Fok Y. Fast feature-based motion estimation algorithms. [Thesis]. Hong Kong University of Science and Technology; 1994. Available from: http://repository.ust.hk/ir/Record/1783.1-4378 ; https://doi.org/10.14711/thesis-b447445 ; http://repository.ust.hk/ir/bitstream/1783.1-4378/1/th_redirect.html

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

17. Tripathi, Pushkar. Allocation problems with partial information.

Degree: PhD, Computing, 2012, Georgia Tech

 Allocation problems have been central to the development of the theory of algorithms and also find applications in several realms of computer science and economics.… (more)

Subjects/Keywords: Approximation algorithms; Allocation problems; Optimization; Online algorithms; Matching; Algorithms

…factor algorithms for the maximum matching and the adwords problem in this model. Finally we… …136 viii LIST OF TABLES 1 Summary of Results for Online Bipartite Matching in Various… …91 7 Graphs with unit size matching . . . . . . . . . . . . . . . . . . . . . 92 8… …SUMMARY Allocation problems have been central to the development of the theory of algorithms… …Concretely, we consider the online bipartite matching problem in the unknown distribution model and… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tripathi, P. (2012). Allocation problems with partial information. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/44789

Chicago Manual of Style (16th Edition):

Tripathi, Pushkar. “Allocation problems with partial information.” 2012. Doctoral Dissertation, Georgia Tech. Accessed January 29, 2020. http://hdl.handle.net/1853/44789.

MLA Handbook (7th Edition):

Tripathi, Pushkar. “Allocation problems with partial information.” 2012. Web. 29 Jan 2020.

Vancouver:

Tripathi P. Allocation problems with partial information. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/1853/44789.

Council of Science Editors:

Tripathi P. Allocation problems with partial information. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/44789


Texas A&M University

18. Liu, Lantao. Linear Sum Assignment Algorithms for Distributed Multi-robot Systems.

Degree: 2013, Texas A&M University

 Multi-robot task assignment (allocation) involves assigning robots to tasks in order to optimize the entire team?s performances. Until now, one of the most useful non-domain-specific… (more)

Subjects/Keywords: Multi-robot systems; task allocation; assignment algorithms; assignment uncertainty; 3D matching graph; task swapping; optimal market-based; distributed assignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, L. (2013). Linear Sum Assignment Algorithms for Distributed Multi-robot Systems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/149316

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, Lantao. “Linear Sum Assignment Algorithms for Distributed Multi-robot Systems.” 2013. Thesis, Texas A&M University. Accessed January 29, 2020. http://hdl.handle.net/1969.1/149316.

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

MLA Handbook (7th Edition):

Liu, Lantao. “Linear Sum Assignment Algorithms for Distributed Multi-robot Systems.” 2013. Web. 29 Jan 2020.

Vancouver:

Liu L. Linear Sum Assignment Algorithms for Distributed Multi-robot Systems. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/1969.1/149316.

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

Council of Science Editors:

Liu L. Linear Sum Assignment Algorithms for Distributed Multi-robot Systems. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/149316

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


University of Florida

19. Jefferson, Aziza F. The Substitution Decomposition of Matchings and RNA Secondary Structures.

Degree: PhD, Mathematics, 2015, University of Florida

 The secondary structure of RNA provides important information about the function of the RNA and its study is a fundamental problem in mathematical biology so… (more)

Subjects/Keywords: Algebra; Algorithms; Family structure; Generating function; Mathematical sequences; Mathematics; Permutations; Polynomials; RNA; Vertices; combinatorics  – enumeration  – matching  – mathematics  – rna  – secondary  – sequence  – structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jefferson, A. F. (2015). The Substitution Decomposition of Matchings and RNA Secondary Structures. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047620

Chicago Manual of Style (16th Edition):

Jefferson, Aziza F. “The Substitution Decomposition of Matchings and RNA Secondary Structures.” 2015. Doctoral Dissertation, University of Florida. Accessed January 29, 2020. http://ufdc.ufl.edu/UFE0047620.

MLA Handbook (7th Edition):

Jefferson, Aziza F. “The Substitution Decomposition of Matchings and RNA Secondary Structures.” 2015. Web. 29 Jan 2020.

Vancouver:

Jefferson AF. The Substitution Decomposition of Matchings and RNA Secondary Structures. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2020 Jan 29]. Available from: http://ufdc.ufl.edu/UFE0047620.

Council of Science Editors:

Jefferson AF. The Substitution Decomposition of Matchings and RNA Secondary Structures. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0047620

20. Kouzinopoulos, Charalampos. Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms.

Degree: 2013, University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών

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

Subjects/Keywords: Αλγόριθμοι; ΑΝΑΖΗΤΗΣΗ ΠΡΟΤΥΠΩΝ; Παράλληλη επεξεργασία; Κάρτες γραφικών; Algorithms; Pattern matching; Parallel procesisng; Parallel computing; GPU; GPGPU; CUDA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kouzinopoulos, C. (2013). Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms. (Thesis). University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών. Retrieved from http://hdl.handle.net/10442/hedi/29868

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

Kouzinopoulos, Charalampos. “Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms.” 2013. Thesis, University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών. Accessed January 29, 2020. http://hdl.handle.net/10442/hedi/29868.

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

MLA Handbook (7th Edition):

Kouzinopoulos, Charalampos. “Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms.” 2013. Web. 29 Jan 2020.

Vancouver:

Kouzinopoulos C. Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms. [Internet] [Thesis]. University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; 2013. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/10442/hedi/29868.

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

Council of Science Editors:

Kouzinopoulos C. Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms. [Thesis]. University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; 2013. Available from: http://hdl.handle.net/10442/hedi/29868

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


University of Western Ontario

21. Isack, Hossam N. Energy Based Multi-Model Fitting and Matching Problems.

Degree: 2014, University of Western Ontario

 Feature matching and model fitting are fundamental problems in multi-view geometry. They are chicken-&-egg problems: if models are known it is easier to find matches… (more)

Subjects/Keywords: Multi-view Geometry; Fitting; Matching; Flow recycling; Label Cost; Artificial Intelligence and Robotics; Computer Sciences; Other Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Isack, H. N. (2014). Energy Based Multi-Model Fitting and Matching Problems. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/2426

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

Isack, Hossam N. “Energy Based Multi-Model Fitting and Matching Problems.” 2014. Thesis, University of Western Ontario. Accessed January 29, 2020. https://ir.lib.uwo.ca/etd/2426.

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

MLA Handbook (7th Edition):

Isack, Hossam N. “Energy Based Multi-Model Fitting and Matching Problems.” 2014. Web. 29 Jan 2020.

Vancouver:

Isack HN. Energy Based Multi-Model Fitting and Matching Problems. [Internet] [Thesis]. University of Western Ontario; 2014. [cited 2020 Jan 29]. Available from: https://ir.lib.uwo.ca/etd/2426.

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

Council of Science Editors:

Isack HN. Energy Based Multi-Model Fitting and Matching Problems. [Thesis]. University of Western Ontario; 2014. Available from: https://ir.lib.uwo.ca/etd/2426

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


University of South Africa

22. Philpin, Elizabeth Mary. Stable matching in preference relationships .

Degree: 2009, University of South Africa

 It is the aim of this paper to review some of the work done on stable matching, and on stable marriage problems in particular. Variants… (more)

Subjects/Keywords: Stable marriage; Matching algorithms; College admissions problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Philpin, E. M. (2009). Stable matching in preference relationships . (Doctoral Dissertation). University of South Africa. Retrieved from http://hdl.handle.net/10500/778

Chicago Manual of Style (16th Edition):

Philpin, Elizabeth Mary. “Stable matching in preference relationships .” 2009. Doctoral Dissertation, University of South Africa. Accessed January 29, 2020. http://hdl.handle.net/10500/778.

MLA Handbook (7th Edition):

Philpin, Elizabeth Mary. “Stable matching in preference relationships .” 2009. Web. 29 Jan 2020.

Vancouver:

Philpin EM. Stable matching in preference relationships . [Internet] [Doctoral dissertation]. University of South Africa; 2009. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/10500/778.

Council of Science Editors:

Philpin EM. Stable matching in preference relationships . [Doctoral Dissertation]. University of South Africa; 2009. Available from: http://hdl.handle.net/10500/778


UCLA

23. GU, JIAQI. Query Language Extensions for Advanced Analytics on Big Data and their Efficient Implementation.

Degree: Computer Science, 2019, UCLA

 Advanced analytics and other Big Data applications call for query languages that can express the complex logic of advanced analytics, and are also amenable to… (more)

Subjects/Keywords: Computer science; Aggregates in Recursion; Declarative Algorithms in SQL; Distributed Computation; Event Pattern Matching; Recursive Query

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

GU, J. (2019). Query Language Extensions for Advanced Analytics on Big Data and their Efficient Implementation. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/731242kq

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

GU, JIAQI. “Query Language Extensions for Advanced Analytics on Big Data and their Efficient Implementation.” 2019. Thesis, UCLA. Accessed January 29, 2020. http://www.escholarship.org/uc/item/731242kq.

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

MLA Handbook (7th Edition):

GU, JIAQI. “Query Language Extensions for Advanced Analytics on Big Data and their Efficient Implementation.” 2019. Web. 29 Jan 2020.

Vancouver:

GU J. Query Language Extensions for Advanced Analytics on Big Data and their Efficient Implementation. [Internet] [Thesis]. UCLA; 2019. [cited 2020 Jan 29]. Available from: http://www.escholarship.org/uc/item/731242kq.

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

Council of Science Editors:

GU J. Query Language Extensions for Advanced Analytics on Big Data and their Efficient Implementation. [Thesis]. UCLA; 2019. Available from: http://www.escholarship.org/uc/item/731242kq

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


University of North Texas

24. Halverson, Ranette Hudson. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.

Degree: 1993, University of North Texas

 The goal of a parallel algorithm is to solve a single problem using multiple processors working together and to do so in an efficient manner.… (more)

Subjects/Keywords: Algorithms.; Parallel processing (Electronic computers); parallel algorithm; parentheses matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Halverson, R. H. (1993). Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278153/

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

Halverson, Ranette Hudson. “Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.” 1993. Thesis, University of North Texas. Accessed January 29, 2020. https://digital.library.unt.edu/ark:/67531/metadc278153/.

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

MLA Handbook (7th Edition):

Halverson, Ranette Hudson. “Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design.” 1993. Web. 29 Jan 2020.

Vancouver:

Halverson RH. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. [Internet] [Thesis]. University of North Texas; 1993. [cited 2020 Jan 29]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278153/.

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

Council of Science Editors:

Halverson RH. Efficient Linked List Ranking Algorithms and Parentheses Matching as a New Strategy for Parallel Algorithm Design. [Thesis]. University of North Texas; 1993. Available from: https://digital.library.unt.edu/ark:/67531/metadc278153/

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


University of Michigan

25. Lee, Gyemin. Machine Learning for Flow Cytometry Data Analysis.

Degree: PhD, Electrical Engineering: Systems, 2011, University of Michigan

 This thesis concerns the problem of automatic flow cytometry data analysis. Flow cytometry is a technique for rapid cell analysis and widely used in many… (more)

Subjects/Keywords: Machine Learning; Flow Cytometry; Support Vector Machine; Mixture Models; EM Algorithms; Statistical File Matching; Electrical Engineering; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, G. (2011). Machine Learning for Flow Cytometry Data Analysis. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/89818

Chicago Manual of Style (16th Edition):

Lee, Gyemin. “Machine Learning for Flow Cytometry Data Analysis.” 2011. Doctoral Dissertation, University of Michigan. Accessed January 29, 2020. http://hdl.handle.net/2027.42/89818.

MLA Handbook (7th Edition):

Lee, Gyemin. “Machine Learning for Flow Cytometry Data Analysis.” 2011. Web. 29 Jan 2020.

Vancouver:

Lee G. Machine Learning for Flow Cytometry Data Analysis. [Internet] [Doctoral dissertation]. University of Michigan; 2011. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/2027.42/89818.

Council of Science Editors:

Lee G. Machine Learning for Flow Cytometry Data Analysis. [Doctoral Dissertation]. University of Michigan; 2011. Available from: http://hdl.handle.net/2027.42/89818


Indian Institute of Science

26. Yuvaraj, Athur Raghuvir. A New Algorithm For Linear Tree Pattern Matching.

Degree: 1996, Indian Institute of Science

Subjects/Keywords: Pattern Perception - Algorithms; Algorithms; Computer Programs; Tree Pattern Matching; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yuvaraj, A. R. (1996). A New Algorithm For Linear Tree Pattern Matching. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1680

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

Yuvaraj, Athur Raghuvir. “A New Algorithm For Linear Tree Pattern Matching.” 1996. Thesis, Indian Institute of Science. Accessed January 29, 2020. http://hdl.handle.net/2005/1680.

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

MLA Handbook (7th Edition):

Yuvaraj, Athur Raghuvir. “A New Algorithm For Linear Tree Pattern Matching.” 1996. Web. 29 Jan 2020.

Vancouver:

Yuvaraj AR. A New Algorithm For Linear Tree Pattern Matching. [Internet] [Thesis]. Indian Institute of Science; 1996. [cited 2020 Jan 29]. Available from: http://hdl.handle.net/2005/1680.

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

Council of Science Editors:

Yuvaraj AR. A New Algorithm For Linear Tree Pattern Matching. [Thesis]. Indian Institute of Science; 1996. Available from: http://hdl.handle.net/2005/1680

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

27. Bhadade, Umesh Shantilal. A general purpose lossless data compression scheme with improved compression ratio and decompression time and optimized for searching and retrieval of string randomly from large collection;.

Degree: Electrical, 2010, Maharaja Sayajirao University of Baroda

Included

Bibliography p. 201-207, Appendix p. 208-271

Advisors/Committee Members: Trivedi, A I.

Subjects/Keywords: Electrical; Data Compression; Lossless Compression Algorithms; Arithmetic Coding; String-matching Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhadade, U. S. (2010). A general purpose lossless data compression scheme with improved compression ratio and decompression time and optimized for searching and retrieval of string randomly from large collection;. (Thesis). Maharaja Sayajirao University of Baroda. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/7488

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

Bhadade, Umesh Shantilal. “A general purpose lossless data compression scheme with improved compression ratio and decompression time and optimized for searching and retrieval of string randomly from large collection;.” 2010. Thesis, Maharaja Sayajirao University of Baroda. Accessed January 29, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/7488.

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

MLA Handbook (7th Edition):

Bhadade, Umesh Shantilal. “A general purpose lossless data compression scheme with improved compression ratio and decompression time and optimized for searching and retrieval of string randomly from large collection;.” 2010. Web. 29 Jan 2020.

Vancouver:

Bhadade US. A general purpose lossless data compression scheme with improved compression ratio and decompression time and optimized for searching and retrieval of string randomly from large collection;. [Internet] [Thesis]. Maharaja Sayajirao University of Baroda; 2010. [cited 2020 Jan 29]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/7488.

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

Council of Science Editors:

Bhadade US. A general purpose lossless data compression scheme with improved compression ratio and decompression time and optimized for searching and retrieval of string randomly from large collection;. [Thesis]. Maharaja Sayajirao University of Baroda; 2010. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/7488

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


Indian Institute of Science

28. Yuvaraj, Athur Raghuvir. A New Algorithm For Linear Tree Pattern Matching.

Degree: 1996, Indian Institute of Science

Subjects/Keywords: Pattern Perception - Algorithms; Algorithms; Computer Programs; Tree Pattern Matching; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yuvaraj, A. R. (1996). A New Algorithm For Linear Tree Pattern Matching. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/1680 ; http://etd.ncsi.iisc.ernet.in/abstracts/2171/G14673-Abs.pdf

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

Yuvaraj, Athur Raghuvir. “A New Algorithm For Linear Tree Pattern Matching.” 1996. Thesis, Indian Institute of Science. Accessed January 29, 2020. http://etd.iisc.ernet.in/handle/2005/1680 ; http://etd.ncsi.iisc.ernet.in/abstracts/2171/G14673-Abs.pdf.

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

MLA Handbook (7th Edition):

Yuvaraj, Athur Raghuvir. “A New Algorithm For Linear Tree Pattern Matching.” 1996. Web. 29 Jan 2020.

Vancouver:

Yuvaraj AR. A New Algorithm For Linear Tree Pattern Matching. [Internet] [Thesis]. Indian Institute of Science; 1996. [cited 2020 Jan 29]. Available from: http://etd.iisc.ernet.in/handle/2005/1680 ; http://etd.ncsi.iisc.ernet.in/abstracts/2171/G14673-Abs.pdf.

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

Council of Science Editors:

Yuvaraj AR. A New Algorithm For Linear Tree Pattern Matching. [Thesis]. Indian Institute of Science; 1996. Available from: http://etd.iisc.ernet.in/handle/2005/1680 ; http://etd.ncsi.iisc.ernet.in/abstracts/2171/G14673-Abs.pdf

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

29. RAJIV PANICKER. Approximate matching of complex structures.

Degree: 2004, National University of Singapore

Subjects/Keywords: Approximate Pattern Matching; Graph Algorithms; Information Retrieval; Regular Expressions; Tree Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

PANICKER, R. (2004). Approximate matching of complex structures. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/14303

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

PANICKER, RAJIV. “Approximate matching of complex structures.” 2004. Thesis, National University of Singapore. Accessed January 29, 2020. http://scholarbank.nus.edu.sg/handle/10635/14303.

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

MLA Handbook (7th Edition):

PANICKER, RAJIV. “Approximate matching of complex structures.” 2004. Web. 29 Jan 2020.

Vancouver:

PANICKER R. Approximate matching of complex structures. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2020 Jan 29]. Available from: http://scholarbank.nus.edu.sg/handle/10635/14303.

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

Council of Science Editors:

PANICKER R. Approximate matching of complex structures. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/14303

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

30. Halappanavar, Mahantesh. Algorithms for Vertex-Weighted Matching in Graphs.

Degree: PhD, Computer Science, 2009, Old Dominion University

  A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex.… (more)

Subjects/Keywords: Parallel half approximation; Vertex-weighted matching; Weighted matching; Matching theory; Graph theory; Computer Sciences; Programming Languages and Compilers; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Halappanavar, M. (2009). Algorithms for Vertex-Weighted Matching in Graphs. (Doctoral Dissertation). Old Dominion University. Retrieved from 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57

Chicago Manual of Style (16th Edition):

Halappanavar, Mahantesh. “Algorithms for Vertex-Weighted Matching in Graphs.” 2009. Doctoral Dissertation, Old Dominion University. Accessed January 29, 2020. 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57.

MLA Handbook (7th Edition):

Halappanavar, Mahantesh. “Algorithms for Vertex-Weighted Matching in Graphs.” 2009. Web. 29 Jan 2020.

Vancouver:

Halappanavar M. Algorithms for Vertex-Weighted Matching in Graphs. [Internet] [Doctoral dissertation]. Old Dominion University; 2009. [cited 2020 Jan 29]. Available from: 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57.

Council of Science Editors:

Halappanavar M. Algorithms for Vertex-Weighted Matching in Graphs. [Doctoral Dissertation]. Old Dominion University; 2009. Available from: 9781109335866 ; https://digitalcommons.odu.edu/computerscience_etds/57

[1] [2] [3]

.