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:(probabilistic models). Showing records 1 – 30 of 237 total matches.

[1] [2] [3] [4] [5] [6] [7] [8]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Oregon State University

1. Lakshminarayanan, Balaji. Probabilistic models for classification of bioacoustic data.

Degree: MS, Electrical and Computer Engineering, 2010, Oregon State University

Probabilistic models have been successfully applied for a wide variety of problems, such as but not limited to information retrieval, computer vision, bio-informatics and speech… (more)

Subjects/Keywords: probabilistic models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lakshminarayanan, B. (2010). Probabilistic models for classification of bioacoustic data. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/19655

Chicago Manual of Style (16th Edition):

Lakshminarayanan, Balaji. “Probabilistic models for classification of bioacoustic data.” 2010. Masters Thesis, Oregon State University. Accessed April 07, 2020. http://hdl.handle.net/1957/19655.

MLA Handbook (7th Edition):

Lakshminarayanan, Balaji. “Probabilistic models for classification of bioacoustic data.” 2010. Web. 07 Apr 2020.

Vancouver:

Lakshminarayanan B. Probabilistic models for classification of bioacoustic data. [Internet] [Masters thesis]. Oregon State University; 2010. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1957/19655.

Council of Science Editors:

Lakshminarayanan B. Probabilistic models for classification of bioacoustic data. [Masters Thesis]. Oregon State University; 2010. Available from: http://hdl.handle.net/1957/19655


Vanderbilt University

2. Doane, Tyler Hill. Theory and Application of Nonlocal Hillslope Sediment Transport.

Degree: PhD, Earth and Environmental Sciences, 2018, Vanderbilt University

 This dissertation explores signatures and consequences of different mathematical descriptions of hillslope sediment transport. Three mathematical models are common in geomorphology â local linear diffusion,… (more)

Subjects/Keywords: probabilistic models; sediment transport; geomorphology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doane, T. H. (2018). Theory and Application of Nonlocal Hillslope Sediment Transport. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-07162018-162148/ ;

Chicago Manual of Style (16th Edition):

Doane, Tyler Hill. “Theory and Application of Nonlocal Hillslope Sediment Transport.” 2018. Doctoral Dissertation, Vanderbilt University. Accessed April 07, 2020. http://etd.library.vanderbilt.edu/available/etd-07162018-162148/ ;.

MLA Handbook (7th Edition):

Doane, Tyler Hill. “Theory and Application of Nonlocal Hillslope Sediment Transport.” 2018. Web. 07 Apr 2020.

Vancouver:

Doane TH. Theory and Application of Nonlocal Hillslope Sediment Transport. [Internet] [Doctoral dissertation]. Vanderbilt University; 2018. [cited 2020 Apr 07]. Available from: http://etd.library.vanderbilt.edu/available/etd-07162018-162148/ ;.

Council of Science Editors:

Doane TH. Theory and Application of Nonlocal Hillslope Sediment Transport. [Doctoral Dissertation]. Vanderbilt University; 2018. Available from: http://etd.library.vanderbilt.edu/available/etd-07162018-162148/ ;


Georgia Tech

3. Shegheva, Snejana. A computational model for solving raven’s progressive matrices intelligence test.

Degree: MS, Computer Science, 2018, Georgia Tech

 Graphical models offer techniques for capturing the structure of many problems in real- world domains and provide means for representation, interpretation, and inference. The modeling… (more)

Subjects/Keywords: Probabilistic graphical models; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shegheva, S. (2018). A computational model for solving raven’s progressive matrices intelligence test. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60191

Chicago Manual of Style (16th Edition):

Shegheva, Snejana. “A computational model for solving raven’s progressive matrices intelligence test.” 2018. Masters Thesis, Georgia Tech. Accessed April 07, 2020. http://hdl.handle.net/1853/60191.

MLA Handbook (7th Edition):

Shegheva, Snejana. “A computational model for solving raven’s progressive matrices intelligence test.” 2018. Web. 07 Apr 2020.

Vancouver:

Shegheva S. A computational model for solving raven’s progressive matrices intelligence test. [Internet] [Masters thesis]. Georgia Tech; 2018. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1853/60191.

Council of Science Editors:

Shegheva S. A computational model for solving raven’s progressive matrices intelligence test. [Masters Thesis]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60191


University of New Mexico

4. Oyen, Diane. Interactive Exploration of Multitask Dependency Networks.

Degree: Department of Computer Science, 2013, University of New Mexico

 Scientists increasingly depend on machine learning algorithms to discover patterns in complex data. Two examples addressed in this dissertation are identifying how information sharing among… (more)

Subjects/Keywords: machine learning; probabilistic graphical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oyen, D. (2013). Interactive Exploration of Multitask Dependency Networks. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/23359

Chicago Manual of Style (16th Edition):

Oyen, Diane. “Interactive Exploration of Multitask Dependency Networks.” 2013. Doctoral Dissertation, University of New Mexico. Accessed April 07, 2020. http://hdl.handle.net/1928/23359.

MLA Handbook (7th Edition):

Oyen, Diane. “Interactive Exploration of Multitask Dependency Networks.” 2013. Web. 07 Apr 2020.

Vancouver:

Oyen D. Interactive Exploration of Multitask Dependency Networks. [Internet] [Doctoral dissertation]. University of New Mexico; 2013. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1928/23359.

Council of Science Editors:

Oyen D. Interactive Exploration of Multitask Dependency Networks. [Doctoral Dissertation]. University of New Mexico; 2013. Available from: http://hdl.handle.net/1928/23359


University of Melbourne

5. Li, Yuan. Probabilistic models for aggregating crowdsourced annotations.

Degree: 2019, University of Melbourne

 This thesis explores aggregation methods for crowdsourced annotations. Crowdsourcing is a popular means of creating training and evaluation datasets for machine learning, e.g. used for… (more)

Subjects/Keywords: crowdsourcing; probabilistic models; Bayesian inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2019). Probabilistic models for aggregating crowdsourced annotations. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/227106

Chicago Manual of Style (16th Edition):

Li, Yuan. “Probabilistic models for aggregating crowdsourced annotations.” 2019. Doctoral Dissertation, University of Melbourne. Accessed April 07, 2020. http://hdl.handle.net/11343/227106.

MLA Handbook (7th Edition):

Li, Yuan. “Probabilistic models for aggregating crowdsourced annotations.” 2019. Web. 07 Apr 2020.

Vancouver:

Li Y. Probabilistic models for aggregating crowdsourced annotations. [Internet] [Doctoral dissertation]. University of Melbourne; 2019. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/11343/227106.

Council of Science Editors:

Li Y. Probabilistic models for aggregating crowdsourced annotations. [Doctoral Dissertation]. University of Melbourne; 2019. Available from: http://hdl.handle.net/11343/227106


Australian National University

6. Mohasel Afshar, Hadi. Probabilistic Inference in Piecewise Graphical Models .

Degree: 2016, Australian National University

 In many applications of probabilistic inference the models contain piecewise densities that are differentiable except at partition boundaries. For instance, (1) some models may intrinsically… (more)

Subjects/Keywords: Piecewise; Graphical models; probabilistic inference; MCMC; sampling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohasel Afshar, H. (2016). Probabilistic Inference in Piecewise Graphical Models . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/107386

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

Mohasel Afshar, Hadi. “Probabilistic Inference in Piecewise Graphical Models .” 2016. Thesis, Australian National University. Accessed April 07, 2020. http://hdl.handle.net/1885/107386.

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

MLA Handbook (7th Edition):

Mohasel Afshar, Hadi. “Probabilistic Inference in Piecewise Graphical Models .” 2016. Web. 07 Apr 2020.

Vancouver:

Mohasel Afshar H. Probabilistic Inference in Piecewise Graphical Models . [Internet] [Thesis]. Australian National University; 2016. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1885/107386.

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

Council of Science Editors:

Mohasel Afshar H. Probabilistic Inference in Piecewise Graphical Models . [Thesis]. Australian National University; 2016. Available from: http://hdl.handle.net/1885/107386

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


University of Toronto

7. Russell, Travis. An MDP-based Coupon Issuing System.

Degree: 2015, University of Toronto

We present a system based on the work of Shani et al. [An MDP-based recommender system," Journal of Machine Learning Research, vol. 6, pp. 1265-1295,… (more)

Subjects/Keywords: machine learning; probabilistic models; recommender systems; 0405

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Russell, T. (2015). An MDP-based Coupon Issuing System. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/70564

Chicago Manual of Style (16th Edition):

Russell, Travis. “An MDP-based Coupon Issuing System.” 2015. Masters Thesis, University of Toronto. Accessed April 07, 2020. http://hdl.handle.net/1807/70564.

MLA Handbook (7th Edition):

Russell, Travis. “An MDP-based Coupon Issuing System.” 2015. Web. 07 Apr 2020.

Vancouver:

Russell T. An MDP-based Coupon Issuing System. [Internet] [Masters thesis]. University of Toronto; 2015. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1807/70564.

Council of Science Editors:

Russell T. An MDP-based Coupon Issuing System. [Masters Thesis]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/70564

8. Gotovos, Alkis. Sampling from Probabilistic Submodular Models.

Degree: 2019, ETH Zürich

 Practical problems of discrete nature are very common in machine learning; application domains include computer vision (e.g., image segmentation), sequential decision making (e.g., active learning),… (more)

Subjects/Keywords: Approximate inference; Probabilistic models; Sampling; Submodularity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gotovos, A. (2019). Sampling from Probabilistic Submodular Models. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/333042

Chicago Manual of Style (16th Edition):

Gotovos, Alkis. “Sampling from Probabilistic Submodular Models.” 2019. Doctoral Dissertation, ETH Zürich. Accessed April 07, 2020. http://hdl.handle.net/20.500.11850/333042.

MLA Handbook (7th Edition):

Gotovos, Alkis. “Sampling from Probabilistic Submodular Models.” 2019. Web. 07 Apr 2020.

Vancouver:

Gotovos A. Sampling from Probabilistic Submodular Models. [Internet] [Doctoral dissertation]. ETH Zürich; 2019. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/20.500.11850/333042.

Council of Science Editors:

Gotovos A. Sampling from Probabilistic Submodular Models. [Doctoral Dissertation]. ETH Zürich; 2019. Available from: http://hdl.handle.net/20.500.11850/333042


University of California – Irvine

9. Lichman, Moshe. Context-Based Smoothing for Personlized Prediction Models.

Degree: Computer Science, 2017, University of California – Irvine

 Software applications that digitally collect and store individual activity data are increasingly prevalent in our daily lives. With the widespread availability of such data, there… (more)

Subjects/Keywords: Computer science; Consumption Modeling; Probabilistic Models; Spatial Models; User Modeling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lichman, M. (2017). Context-Based Smoothing for Personlized Prediction Models. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/7373h1rg

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

Lichman, Moshe. “Context-Based Smoothing for Personlized Prediction Models.” 2017. Thesis, University of California – Irvine. Accessed April 07, 2020. http://www.escholarship.org/uc/item/7373h1rg.

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

MLA Handbook (7th Edition):

Lichman, Moshe. “Context-Based Smoothing for Personlized Prediction Models.” 2017. Web. 07 Apr 2020.

Vancouver:

Lichman M. Context-Based Smoothing for Personlized Prediction Models. [Internet] [Thesis]. University of California – Irvine; 2017. [cited 2020 Apr 07]. Available from: http://www.escholarship.org/uc/item/7373h1rg.

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

Council of Science Editors:

Lichman M. Context-Based Smoothing for Personlized Prediction Models. [Thesis]. University of California – Irvine; 2017. Available from: http://www.escholarship.org/uc/item/7373h1rg

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

10. Tang, Qiyi. Computing Probabilistic Bisimilarity Distances.

Degree: PhD, Computer Science, 2018, York University

 Behavioural equivalences like probabilistic bisimilarity rely on the transition probabilities and, as a result, are sensitive to minuscule changes of those probabilities. Such behavioural equivalences… (more)

Subjects/Keywords: Computer science; Probabilistic bisimilarity distances; Bisimulation metric; Probabilistic models; Model checking; Concurrency; Labelled Markov chains; Algorithms; Probabilistic automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tang, Q. (2018). Computing Probabilistic Bisimilarity Distances. (Doctoral Dissertation). York University. Retrieved from http://hdl.handle.net/10315/35586

Chicago Manual of Style (16th Edition):

Tang, Qiyi. “Computing Probabilistic Bisimilarity Distances.” 2018. Doctoral Dissertation, York University. Accessed April 07, 2020. http://hdl.handle.net/10315/35586.

MLA Handbook (7th Edition):

Tang, Qiyi. “Computing Probabilistic Bisimilarity Distances.” 2018. Web. 07 Apr 2020.

Vancouver:

Tang Q. Computing Probabilistic Bisimilarity Distances. [Internet] [Doctoral dissertation]. York University; 2018. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/10315/35586.

Council of Science Editors:

Tang Q. Computing Probabilistic Bisimilarity Distances. [Doctoral Dissertation]. York University; 2018. Available from: http://hdl.handle.net/10315/35586


University of California – Berkeley

11. Wang, Zhe. Extracting and Querying Probabilistic Information in BayesStore.

Degree: Electrical Engineering & Computer Sciences, 2011, University of California – Berkeley

 During the past few years, the number of applications that need to process large-scale data has grown remarkably. The data driving these applications are often… (more)

Subjects/Keywords: Computer science; Conditional Random Fields; Database; Probabilistic Database; Probabilistic Graphical Models; Query-driven; Text Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Z. (2011). Extracting and Querying Probabilistic Information in BayesStore. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/3557w390

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

Wang, Zhe. “Extracting and Querying Probabilistic Information in BayesStore.” 2011. Thesis, University of California – Berkeley. Accessed April 07, 2020. http://www.escholarship.org/uc/item/3557w390.

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

MLA Handbook (7th Edition):

Wang, Zhe. “Extracting and Querying Probabilistic Information in BayesStore.” 2011. Web. 07 Apr 2020.

Vancouver:

Wang Z. Extracting and Querying Probabilistic Information in BayesStore. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Apr 07]. Available from: http://www.escholarship.org/uc/item/3557w390.

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

Council of Science Editors:

Wang Z. Extracting and Querying Probabilistic Information in BayesStore. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/3557w390

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


The Ohio State University

12. Cohn, Brian E. Reduced Order Modeling of Dynamic Systems for Decreasing Computational Burden in Uncertainty Quantification.

Degree: MS, Nuclear Engineering, 2018, The Ohio State University

 Dynamic Probabilistic Risk Assessment (DPRA) is a method that has demonstrated usefulness for safety analysis of nuclear power plants. DPRA is based on constructing computer… (more)

Subjects/Keywords: Nuclear Engineering; DPRA; PRA; Probabilistic Risk Assessment; Reduced Order Models; Seismic Probabilistic Risk Assessment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cohn, B. E. (2018). Reduced Order Modeling of Dynamic Systems for Decreasing Computational Burden in Uncertainty Quantification. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1531425355869627

Chicago Manual of Style (16th Edition):

Cohn, Brian E. “Reduced Order Modeling of Dynamic Systems for Decreasing Computational Burden in Uncertainty Quantification.” 2018. Masters Thesis, The Ohio State University. Accessed April 07, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1531425355869627.

MLA Handbook (7th Edition):

Cohn, Brian E. “Reduced Order Modeling of Dynamic Systems for Decreasing Computational Burden in Uncertainty Quantification.” 2018. Web. 07 Apr 2020.

Vancouver:

Cohn BE. Reduced Order Modeling of Dynamic Systems for Decreasing Computational Burden in Uncertainty Quantification. [Internet] [Masters thesis]. The Ohio State University; 2018. [cited 2020 Apr 07]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531425355869627.

Council of Science Editors:

Cohn BE. Reduced Order Modeling of Dynamic Systems for Decreasing Computational Burden in Uncertainty Quantification. [Masters Thesis]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531425355869627


University of Illinois – Urbana-Champaign

13. Choi, Jaesik. Lifted Inference for Relational Hybrid Models.

Degree: PhD, 0112, 2012, University of Illinois – Urbana-Champaign

Probabilistic Graphical Models (PGMs) promise to play a prominent role in many complex real-world systems. Probabilistic Relational Graphical Models (PRGMs) scale the representation and learning… (more)

Subjects/Keywords: Probabilistic Graphical Models; Relational Hybrid Models; Lifted Inference; First-Order Probabilistic Models; Probabilistic Logic; Kalman filter; Relational Kalman filter; Variational Learning, Markov Logic Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, J. (2012). Lifted Inference for Relational Hybrid Models. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/32004

Chicago Manual of Style (16th Edition):

Choi, Jaesik. “Lifted Inference for Relational Hybrid Models.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 07, 2020. http://hdl.handle.net/2142/32004.

MLA Handbook (7th Edition):

Choi, Jaesik. “Lifted Inference for Relational Hybrid Models.” 2012. Web. 07 Apr 2020.

Vancouver:

Choi J. Lifted Inference for Relational Hybrid Models. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/2142/32004.

Council of Science Editors:

Choi J. Lifted Inference for Relational Hybrid Models. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/32004

14. Villanueva Talavera, Edwin Rafael. Métodos Bayesianos aplicados em taxonomia molecular.

Degree: Mestrado, Processamento de Sinais de Instrumentação, 2007, University of São Paulo

Neste trabalho são apresentados dois métodos de agrupamento de dados visados para aplicações em taxonomia molecular. Estes métodos estão baseados em modelos probabilísticos, o que… (more)

Subjects/Keywords: Agrupamento; Agrupamento hierárquico; Clustering; Hierarchical clustering; Modelos gráficos probabilísticos; Modelos probabilísticos; Molecular taxonomy; Probabilistic graphical models; Probabilistic models; Taxonomia molecular

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Villanueva Talavera, E. R. (2007). Métodos Bayesianos aplicados em taxonomia molecular. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;

Chicago Manual of Style (16th Edition):

Villanueva Talavera, Edwin Rafael. “Métodos Bayesianos aplicados em taxonomia molecular.” 2007. Masters Thesis, University of São Paulo. Accessed April 07, 2020. http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;.

MLA Handbook (7th Edition):

Villanueva Talavera, Edwin Rafael. “Métodos Bayesianos aplicados em taxonomia molecular.” 2007. Web. 07 Apr 2020.

Vancouver:

Villanueva Talavera ER. Métodos Bayesianos aplicados em taxonomia molecular. [Internet] [Masters thesis]. University of São Paulo; 2007. [cited 2020 Apr 07]. Available from: http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;.

Council of Science Editors:

Villanueva Talavera ER. Métodos Bayesianos aplicados em taxonomia molecular. [Masters Thesis]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/18/18152/tde-03102007-105125/ ;


University of Alberta

15. Shaoul, Cyrus. The Processing of Lexical Sequences.

Degree: PhD, Department of Psychology, 2012, University of Alberta

 Psycholinguistics has traditionally been defined as the study of how we process units of language such as letters, words and sentences. But what about other… (more)

Subjects/Keywords: probabilistic models; subjective frequency; cloze; n-grams; reading; lexical sequences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shaoul, C. (2012). The Processing of Lexical Sequences. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/vt150k544

Chicago Manual of Style (16th Edition):

Shaoul, Cyrus. “The Processing of Lexical Sequences.” 2012. Doctoral Dissertation, University of Alberta. Accessed April 07, 2020. https://era.library.ualberta.ca/files/vt150k544.

MLA Handbook (7th Edition):

Shaoul, Cyrus. “The Processing of Lexical Sequences.” 2012. Web. 07 Apr 2020.

Vancouver:

Shaoul C. The Processing of Lexical Sequences. [Internet] [Doctoral dissertation]. University of Alberta; 2012. [cited 2020 Apr 07]. Available from: https://era.library.ualberta.ca/files/vt150k544.

Council of Science Editors:

Shaoul C. The Processing of Lexical Sequences. [Doctoral Dissertation]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/vt150k544


RMIT University

16. Queiroz Batista da Silva, C. A holistic approach for measuring the survivability of SCADA systems.

Degree: 2012, RMIT University

 Supervisory Control and Data Acquisition (SCADA) systems are responsible for controlling and monitoring Industrial Control Systems (ICS) and Critical Infrastructure Systems (CIS) among others. Such… (more)

Subjects/Keywords: Fields of Research; SCADA; Survivability; Probabilistic Graphical Models; Security; Performance

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Queiroz Batista da Silva, C. (2012). A holistic approach for measuring the survivability of SCADA systems. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:160341

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

Queiroz Batista da Silva, C. “A holistic approach for measuring the survivability of SCADA systems.” 2012. Thesis, RMIT University. Accessed April 07, 2020. http://researchbank.rmit.edu.au/view/rmit:160341.

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

MLA Handbook (7th Edition):

Queiroz Batista da Silva, C. “A holistic approach for measuring the survivability of SCADA systems.” 2012. Web. 07 Apr 2020.

Vancouver:

Queiroz Batista da Silva C. A holistic approach for measuring the survivability of SCADA systems. [Internet] [Thesis]. RMIT University; 2012. [cited 2020 Apr 07]. Available from: http://researchbank.rmit.edu.au/view/rmit:160341.

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

Council of Science Editors:

Queiroz Batista da Silva C. A holistic approach for measuring the survivability of SCADA systems. [Thesis]. RMIT University; 2012. Available from: http://researchbank.rmit.edu.au/view/rmit:160341

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

17. BERTOLINI, Cristiano. Evaluation of GUI testing techniques for system crashing: from real to model-based controlled experiments .

Degree: 2010, Universidade Federal de Pernambuco

 Aplicações para celular estão se tornando cada vez mais complexas, bem como testá-las. Teste de interfaces gráficas (GUI) é uma tendência atual e se faz,… (more)

Subjects/Keywords: GUI Testing; Experimental Software Engineering; Model Checking; Computer Experiments; Probabilistic Models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

BERTOLINI, C. (2010). Evaluation of GUI testing techniques for system crashing: from real to model-based controlled experiments . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/2076

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

BERTOLINI, Cristiano. “Evaluation of GUI testing techniques for system crashing: from real to model-based controlled experiments .” 2010. Thesis, Universidade Federal de Pernambuco. Accessed April 07, 2020. http://repositorio.ufpe.br/handle/123456789/2076.

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

MLA Handbook (7th Edition):

BERTOLINI, Cristiano. “Evaluation of GUI testing techniques for system crashing: from real to model-based controlled experiments .” 2010. Web. 07 Apr 2020.

Vancouver:

BERTOLINI C. Evaluation of GUI testing techniques for system crashing: from real to model-based controlled experiments . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2010. [cited 2020 Apr 07]. Available from: http://repositorio.ufpe.br/handle/123456789/2076.

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

Council of Science Editors:

BERTOLINI C. Evaluation of GUI testing techniques for system crashing: from real to model-based controlled experiments . [Thesis]. Universidade Federal de Pernambuco; 2010. Available from: http://repositorio.ufpe.br/handle/123456789/2076

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


Penn State University

18. Paulson, Elisabeth C. A Reformulation of the CSSR Algorithm and Application to Optimal Deception Strategy in Two Player Games.

Degree: MA, Mathematics, 2015, Penn State University

 In this thesis we explore a reformulation of the Casual State Splitting and Reconstruction (CSSR) algorithm and an application to optimal strategies for deception in… (more)

Subjects/Keywords: hidden markov models; probabilistic finite-state machine; deception strategy; game theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Paulson, E. C. (2015). A Reformulation of the CSSR Algorithm and Application to Optimal Deception Strategy in Two Player Games. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/25044

Chicago Manual of Style (16th Edition):

Paulson, Elisabeth C. “A Reformulation of the CSSR Algorithm and Application to Optimal Deception Strategy in Two Player Games.” 2015. Masters Thesis, Penn State University. Accessed April 07, 2020. https://etda.libraries.psu.edu/catalog/25044.

MLA Handbook (7th Edition):

Paulson, Elisabeth C. “A Reformulation of the CSSR Algorithm and Application to Optimal Deception Strategy in Two Player Games.” 2015. Web. 07 Apr 2020.

Vancouver:

Paulson EC. A Reformulation of the CSSR Algorithm and Application to Optimal Deception Strategy in Two Player Games. [Internet] [Masters thesis]. Penn State University; 2015. [cited 2020 Apr 07]. Available from: https://etda.libraries.psu.edu/catalog/25044.

Council of Science Editors:

Paulson EC. A Reformulation of the CSSR Algorithm and Application to Optimal Deception Strategy in Two Player Games. [Masters Thesis]. Penn State University; 2015. Available from: https://etda.libraries.psu.edu/catalog/25044


University of California – Berkeley

19. Barrett, Leon Rubin. An Architecture for Structured, Concurrent, Real-Time Action.

Degree: Electrical Engineering & Computer Sciences, 2010, University of California – Berkeley

 I present a computational architecture designed to capture certain properties essential to actions, including compositionality, concurrency, quick reactions, and resilience in the face of unexpected… (more)

Subjects/Keywords: Artificial Intelligence; Computer Science; action representation; Petri nets; probabilistic relational models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barrett, L. R. (2010). An Architecture for Structured, Concurrent, Real-Time Action. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8kh7n8kf

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

Barrett, Leon Rubin. “An Architecture for Structured, Concurrent, Real-Time Action.” 2010. Thesis, University of California – Berkeley. Accessed April 07, 2020. http://www.escholarship.org/uc/item/8kh7n8kf.

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

MLA Handbook (7th Edition):

Barrett, Leon Rubin. “An Architecture for Structured, Concurrent, Real-Time Action.” 2010. Web. 07 Apr 2020.

Vancouver:

Barrett LR. An Architecture for Structured, Concurrent, Real-Time Action. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2020 Apr 07]. Available from: http://www.escholarship.org/uc/item/8kh7n8kf.

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

Council of Science Editors:

Barrett LR. An Architecture for Structured, Concurrent, Real-Time Action. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/8kh7n8kf

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


University of California – Berkeley

20. Cadieu, Charles. Probabilistic Models of Phase Variables for Visual Representation and Neural Dynamics.

Degree: Neuroscience, 2009, University of California – Berkeley

 My work seeks to contribute to three broad goals: predicting the computational representations found in the brain, developing algorithms that help us infer the computations… (more)

Subjects/Keywords: Biology, Neuroscience; Neural Dynamics; Phase Variables; Probabilistic Models; Visual Neuroscience

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cadieu, C. (2009). Probabilistic Models of Phase Variables for Visual Representation and Neural Dynamics. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5ff6t88m

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

Cadieu, Charles. “Probabilistic Models of Phase Variables for Visual Representation and Neural Dynamics.” 2009. Thesis, University of California – Berkeley. Accessed April 07, 2020. http://www.escholarship.org/uc/item/5ff6t88m.

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

MLA Handbook (7th Edition):

Cadieu, Charles. “Probabilistic Models of Phase Variables for Visual Representation and Neural Dynamics.” 2009. Web. 07 Apr 2020.

Vancouver:

Cadieu C. Probabilistic Models of Phase Variables for Visual Representation and Neural Dynamics. [Internet] [Thesis]. University of California – Berkeley; 2009. [cited 2020 Apr 07]. Available from: http://www.escholarship.org/uc/item/5ff6t88m.

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

Council of Science Editors:

Cadieu C. Probabilistic Models of Phase Variables for Visual Representation and Neural Dynamics. [Thesis]. University of California – Berkeley; 2009. Available from: http://www.escholarship.org/uc/item/5ff6t88m

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

21. Ayadi, Inès. Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models.

Degree: Docteur es, Informatique, 2013, Université Paris-Est

 Actuellement, les équipements employés dans les milieux industriels sont de plus en plus complexes. Ils exigent une maintenance accrue afin de garantir un niveau de… (more)

Subjects/Keywords: Modèles graphiques probabilistes; Optimisation; Métaheuristique; Graphical probabilistic models; Optimization; Metaheuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ayadi, I. (2013). Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2013PEST1072

Chicago Manual of Style (16th Edition):

Ayadi, Inès. “Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models.” 2013. Doctoral Dissertation, Université Paris-Est. Accessed April 07, 2020. http://www.theses.fr/2013PEST1072.

MLA Handbook (7th Edition):

Ayadi, Inès. “Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models.” 2013. Web. 07 Apr 2020.

Vancouver:

Ayadi I. Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models. [Internet] [Doctoral dissertation]. Université Paris-Est; 2013. [cited 2020 Apr 07]. Available from: http://www.theses.fr/2013PEST1072.

Council of Science Editors:

Ayadi I. Optimisation des politiques de maintenance préventive dans un cadre de modélisation par modèles graphiques probabilistes : Optimization of Preventive Maintenance Policies in a context of modelisation by probabilistic graphical models. [Doctoral Dissertation]. Université Paris-Est; 2013. Available from: http://www.theses.fr/2013PEST1072


University of Edinburgh

22. Eshky, Aciel. Generative probabilistic models of goal-directed users in task-oriented dialogs.

Degree: PhD, 2014, University of Edinburgh

 A longstanding objective of human-computer interaction research is to develop better dialog systems for end users. The subset of user modelling research specifically, aims to… (more)

Subjects/Keywords: 006.3; models of interlocutors; dialog management; machine learning; probabilistic modelling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eshky, A. (2014). Generative probabilistic models of goal-directed users in task-oriented dialogs. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/15947

Chicago Manual of Style (16th Edition):

Eshky, Aciel. “Generative probabilistic models of goal-directed users in task-oriented dialogs.” 2014. Doctoral Dissertation, University of Edinburgh. Accessed April 07, 2020. http://hdl.handle.net/1842/15947.

MLA Handbook (7th Edition):

Eshky, Aciel. “Generative probabilistic models of goal-directed users in task-oriented dialogs.” 2014. Web. 07 Apr 2020.

Vancouver:

Eshky A. Generative probabilistic models of goal-directed users in task-oriented dialogs. [Internet] [Doctoral dissertation]. University of Edinburgh; 2014. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1842/15947.

Council of Science Editors:

Eshky A. Generative probabilistic models of goal-directed users in task-oriented dialogs. [Doctoral Dissertation]. University of Edinburgh; 2014. Available from: http://hdl.handle.net/1842/15947


University of Toronto

23. Deng, Paul Tiange. Probabilistic Urban Stormwater Quantity Modeling.

Degree: 2015, University of Toronto

Analytical probabilistic models (APMs) for urban drainage systems analysis have been progressively developed by numerous researchers spanning the globe over the last four decades. The… (more)

Subjects/Keywords: analytical probabilistic models; bivariate copulas; quantity control analysis; 0364

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deng, P. T. (2015). Probabilistic Urban Stormwater Quantity Modeling. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/70293

Chicago Manual of Style (16th Edition):

Deng, Paul Tiange. “Probabilistic Urban Stormwater Quantity Modeling.” 2015. Masters Thesis, University of Toronto. Accessed April 07, 2020. http://hdl.handle.net/1807/70293.

MLA Handbook (7th Edition):

Deng, Paul Tiange. “Probabilistic Urban Stormwater Quantity Modeling.” 2015. Web. 07 Apr 2020.

Vancouver:

Deng PT. Probabilistic Urban Stormwater Quantity Modeling. [Internet] [Masters thesis]. University of Toronto; 2015. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1807/70293.

Council of Science Editors:

Deng PT. Probabilistic Urban Stormwater Quantity Modeling. [Masters Thesis]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/70293


University of Toronto

24. Dhoot, Aditya. Wind Farm Layout Optimization Using Approximate Inference in Graphical Models.

Degree: 2016, University of Toronto

Wind farm layout optimization (WFLO) determines the optimal location of wind turbines within a fixed geographical area to maximize the total power capacity of the… (more)

Subjects/Keywords: approximate inference; probabilistic graphical models; wind farm design; 0796

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dhoot, A. (2016). Wind Farm Layout Optimization Using Approximate Inference in Graphical Models. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/72692

Chicago Manual of Style (16th Edition):

Dhoot, Aditya. “Wind Farm Layout Optimization Using Approximate Inference in Graphical Models.” 2016. Masters Thesis, University of Toronto. Accessed April 07, 2020. http://hdl.handle.net/1807/72692.

MLA Handbook (7th Edition):

Dhoot, Aditya. “Wind Farm Layout Optimization Using Approximate Inference in Graphical Models.” 2016. Web. 07 Apr 2020.

Vancouver:

Dhoot A. Wind Farm Layout Optimization Using Approximate Inference in Graphical Models. [Internet] [Masters thesis]. University of Toronto; 2016. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1807/72692.

Council of Science Editors:

Dhoot A. Wind Farm Layout Optimization Using Approximate Inference in Graphical Models. [Masters Thesis]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/72692


University of Waterloo

25. Soliman, Mohamed. Ranked Retrieval in Uncertain and Probabilistic Databases.

Degree: 2011, University of Waterloo

 Ranking queries are widely used in data exploration, data analysis and decision making scenarios. While most of the currently proposed ranking techniques focus on deterministic… (more)

Subjects/Keywords: Ranking; Uncertainty; Probabilistic Models; Query Processing; Top-k; Partial Order

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Soliman, M. (2011). Ranked Retrieval in Uncertain and Probabilistic Databases. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5724

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

Soliman, Mohamed. “Ranked Retrieval in Uncertain and Probabilistic Databases.” 2011. Thesis, University of Waterloo. Accessed April 07, 2020. http://hdl.handle.net/10012/5724.

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

MLA Handbook (7th Edition):

Soliman, Mohamed. “Ranked Retrieval in Uncertain and Probabilistic Databases.” 2011. Web. 07 Apr 2020.

Vancouver:

Soliman M. Ranked Retrieval in Uncertain and Probabilistic Databases. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/10012/5724.

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

Council of Science Editors:

Soliman M. Ranked Retrieval in Uncertain and Probabilistic Databases. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5724

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


University of New South Wales

26. Cummins, Nicholas. Automatic assessment of depression from speech: paralinguistic analysis, modelling and machine learning.

Degree: Electrical Engineering & Telecommunications, 2016, University of New South Wales

 Clinical depression is a prominent cause of disability and burden worldwide. Despite this prevalence, the diagnosis of depression, due to its complex clinical characterisation, is… (more)

Subjects/Keywords: Paralinguistic cues; Acoustic Volume measures; Probabilistic Acoustic Volume (PAV); Acoustic models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cummins, N. (2016). Automatic assessment of depression from speech: paralinguistic analysis, modelling and machine learning. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/55642 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:38198/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Cummins, Nicholas. “Automatic assessment of depression from speech: paralinguistic analysis, modelling and machine learning.” 2016. Doctoral Dissertation, University of New South Wales. Accessed April 07, 2020. http://handle.unsw.edu.au/1959.4/55642 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:38198/SOURCE02?view=true.

MLA Handbook (7th Edition):

Cummins, Nicholas. “Automatic assessment of depression from speech: paralinguistic analysis, modelling and machine learning.” 2016. Web. 07 Apr 2020.

Vancouver:

Cummins N. Automatic assessment of depression from speech: paralinguistic analysis, modelling and machine learning. [Internet] [Doctoral dissertation]. University of New South Wales; 2016. [cited 2020 Apr 07]. Available from: http://handle.unsw.edu.au/1959.4/55642 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:38198/SOURCE02?view=true.

Council of Science Editors:

Cummins N. Automatic assessment of depression from speech: paralinguistic analysis, modelling and machine learning. [Doctoral Dissertation]. University of New South Wales; 2016. Available from: http://handle.unsw.edu.au/1959.4/55642 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:38198/SOURCE02?view=true

27. Mauá, Denis Deratani. Algorithms and complexity results for discrete probabilistic reasoning tasks.

Degree: 2013, Università della Svizzera italiana

 Many solutions to problems in machine learning and artificial intelligence involve solving a combinatorial optimization problem over discrete variables whose functional dependence is conveniently represented… (more)

Subjects/Keywords: Probabilistic graphical models

…posteriori inference in discrete probabilistic graphical models (more precisely, in Bayesian… …probabilistic graphical models. These are multivariate models where irrelevance assessments between… …visual representation of either type of model. Probabilistic models often include latent… …models, whether we assume epistemic irrelevance or strong independence. Acknowledgements This… …Maximum a posteriori inference 2.1 Graphical models and the MAP assignment problem . . . . 2.2… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mauá, D. D. (2013). Algorithms and complexity results for discrete probabilistic reasoning tasks. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/203103

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

Mauá, Denis Deratani. “Algorithms and complexity results for discrete probabilistic reasoning tasks.” 2013. Thesis, Università della Svizzera italiana. Accessed April 07, 2020. http://doc.rero.ch/record/203103.

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

MLA Handbook (7th Edition):

Mauá, Denis Deratani. “Algorithms and complexity results for discrete probabilistic reasoning tasks.” 2013. Web. 07 Apr 2020.

Vancouver:

Mauá DD. Algorithms and complexity results for discrete probabilistic reasoning tasks. [Internet] [Thesis]. Università della Svizzera italiana; 2013. [cited 2020 Apr 07]. Available from: http://doc.rero.ch/record/203103.

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

Council of Science Editors:

Mauá DD. Algorithms and complexity results for discrete probabilistic reasoning tasks. [Thesis]. Università della Svizzera italiana; 2013. Available from: http://doc.rero.ch/record/203103

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


KTH

28. Hamesse, Charles. Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture.

Degree: RPL, 2018, KTH

Achilles tendonbrott (Achilles Tendon Rupture, ATR) är en av de typiska mjukvävnadsskadorna. Rehabilitering efter sådana muskuloskeletala skador förblir en långvarig process med ett mycket… (more)

Subjects/Keywords: Machine learning; Probabilistic graphical models; Healthcare; Computer Systems; Datorsystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hamesse, C. (2018). Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485

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

Hamesse, Charles. “Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture.” 2018. Thesis, KTH. Accessed April 07, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485.

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

MLA Handbook (7th Edition):

Hamesse, Charles. “Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture.” 2018. Web. 07 Apr 2020.

Vancouver:

Hamesse C. Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture. [Internet] [Thesis]. KTH; 2018. [cited 2020 Apr 07]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485.

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

Council of Science Editors:

Hamesse C. Simultaneous Measurement Imputation and Rehabilitation Outcome Prediction for Achilles Tendon Rupture. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231485

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


Duke University

29. Shan, Shan. Probabilistic Models on Fibre Bundles .

Degree: 2019, Duke University

  In this thesis, we propose probabilistic models on fibre bundles for learning the generative process of data. The main tool we use is the… (more)

Subjects/Keywords: Mathematics; Bayesian statistics; Dimension reduction; Fibre bundles; Probabilistic models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shan, S. (2019). Probabilistic Models on Fibre Bundles . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/19890

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

Shan, Shan. “Probabilistic Models on Fibre Bundles .” 2019. Thesis, Duke University. Accessed April 07, 2020. http://hdl.handle.net/10161/19890.

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

MLA Handbook (7th Edition):

Shan, Shan. “Probabilistic Models on Fibre Bundles .” 2019. Web. 07 Apr 2020.

Vancouver:

Shan S. Probabilistic Models on Fibre Bundles . [Internet] [Thesis]. Duke University; 2019. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/10161/19890.

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

Council of Science Editors:

Shan S. Probabilistic Models on Fibre Bundles . [Thesis]. Duke University; 2019. Available from: http://hdl.handle.net/10161/19890

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


University of Toronto

30. Lazic, Nevena. Message Passing Algorithms for Facility Location Problems.

Degree: 2011, University of Toronto

Discrete location analysis is one of the most widely studied branches of operations research, whose applications arise in a wide variety of settings. This thesis… (more)

Subjects/Keywords: probabilistic graphical models; facility location; MAP inference; 0544

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lazic, N. (2011). Message Passing Algorithms for Facility Location Problems. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/27587

Chicago Manual of Style (16th Edition):

Lazic, Nevena. “Message Passing Algorithms for Facility Location Problems.” 2011. Doctoral Dissertation, University of Toronto. Accessed April 07, 2020. http://hdl.handle.net/1807/27587.

MLA Handbook (7th Edition):

Lazic, Nevena. “Message Passing Algorithms for Facility Location Problems.” 2011. Web. 07 Apr 2020.

Vancouver:

Lazic N. Message Passing Algorithms for Facility Location Problems. [Internet] [Doctoral dissertation]. University of Toronto; 2011. [cited 2020 Apr 07]. Available from: http://hdl.handle.net/1807/27587.

Council of Science Editors:

Lazic N. Message Passing Algorithms for Facility Location Problems. [Doctoral Dissertation]. University of Toronto; 2011. Available from: http://hdl.handle.net/1807/27587

[1] [2] [3] [4] [5] [6] [7] [8]

.