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:(exact inference). Showing records 1 – 9 of 9 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Cornell University

1. Wang, Ke Alexander. Large Scale Exact Gaussian Processes Inference and Euclidean Constrained Neural Networks with Physics Priors.

Degree: M.S., Computer Science, Computer Science, 2020, Cornell University

 Intelligent systems that interact with the physical world must be able to model the underlying dynamics accurately to be able to make informed actions and… (more)

Subjects/Keywords: exact inference; Gaussian process; hamiltonian; lagrangian; neural networks; physics priors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, K. A. (2020). Large Scale Exact Gaussian Processes Inference and Euclidean Constrained Neural Networks with Physics Priors. (Masters Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/70285

Chicago Manual of Style (16th Edition):

Wang, Ke Alexander. “Large Scale Exact Gaussian Processes Inference and Euclidean Constrained Neural Networks with Physics Priors.” 2020. Masters Thesis, Cornell University. Accessed April 22, 2021. http://hdl.handle.net/1813/70285.

MLA Handbook (7th Edition):

Wang, Ke Alexander. “Large Scale Exact Gaussian Processes Inference and Euclidean Constrained Neural Networks with Physics Priors.” 2020. Web. 22 Apr 2021.

Vancouver:

Wang KA. Large Scale Exact Gaussian Processes Inference and Euclidean Constrained Neural Networks with Physics Priors. [Internet] [Masters thesis]. Cornell University; 2020. [cited 2021 Apr 22]. Available from: http://hdl.handle.net/1813/70285.

Council of Science Editors:

Wang KA. Large Scale Exact Gaussian Processes Inference and Euclidean Constrained Neural Networks with Physics Priors. [Masters Thesis]. Cornell University; 2020. Available from: http://hdl.handle.net/1813/70285


University of Wolverhampton

2. Aziz, Wilker Ferreira. Exact sampling and optimisation in statistical machine translation.

Degree: PhD, 2014, University of Wolverhampton

 In Statistical Machine Translation (SMT), inference needs to be performed over a high-complexity discrete distribution de ned by the intersection between a translation hypergraph and… (more)

Subjects/Keywords: 418.020285635; statistical machine translation; exact inference; optimisation; sampling; coarse-to-fine search; decoding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aziz, W. F. (2014). Exact sampling and optimisation in statistical machine translation. (Doctoral Dissertation). University of Wolverhampton. Retrieved from http://hdl.handle.net/2436/314591

Chicago Manual of Style (16th Edition):

Aziz, Wilker Ferreira. “Exact sampling and optimisation in statistical machine translation.” 2014. Doctoral Dissertation, University of Wolverhampton. Accessed April 22, 2021. http://hdl.handle.net/2436/314591.

MLA Handbook (7th Edition):

Aziz, Wilker Ferreira. “Exact sampling and optimisation in statistical machine translation.” 2014. Web. 22 Apr 2021.

Vancouver:

Aziz WF. Exact sampling and optimisation in statistical machine translation. [Internet] [Doctoral dissertation]. University of Wolverhampton; 2014. [cited 2021 Apr 22]. Available from: http://hdl.handle.net/2436/314591.

Council of Science Editors:

Aziz WF. Exact sampling and optimisation in statistical machine translation. [Doctoral Dissertation]. University of Wolverhampton; 2014. Available from: http://hdl.handle.net/2436/314591


UCLA

3. Chen, Suming Jeremiah. Robust Decision Making with the Same-Decision Probability.

Degree: Computer Science, 2015, UCLA

 When making decisions under uncertainty, the optimal choices are often difficult to discern, especially if not enough information has been gathered. Two key questions in… (more)

Subjects/Keywords: Computer science; Artificial intelligence; automated reasoning; Bayesian networks; decision making; exact probabilistic inference; machine learning; robustness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, S. J. (2015). Robust Decision Making with the Same-Decision Probability. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/5qh0c61r

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

Chicago Manual of Style (16th Edition):

Chen, Suming Jeremiah. “Robust Decision Making with the Same-Decision Probability.” 2015. Thesis, UCLA. Accessed April 22, 2021. http://www.escholarship.org/uc/item/5qh0c61r.

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

MLA Handbook (7th Edition):

Chen, Suming Jeremiah. “Robust Decision Making with the Same-Decision Probability.” 2015. Web. 22 Apr 2021.

Vancouver:

Chen SJ. Robust Decision Making with the Same-Decision Probability. [Internet] [Thesis]. UCLA; 2015. [cited 2021 Apr 22]. Available from: http://www.escholarship.org/uc/item/5qh0c61r.

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

Council of Science Editors:

Chen SJ. Robust Decision Making with the Same-Decision Probability. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/5qh0c61r

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


University of Colorado

4. Gaertner, Matthew Newman. Assessing a New Approach to Class-Based Affirmative Action.

Degree: PhD, Education, 2011, University of Colorado

  In November, 2008, Colorado and Nebraska voted on amendments that sought to end race-based affirmative action at public universities in those states. In anticipation… (more)

Subjects/Keywords: Affirmative Action; Causal Inference; Coarsened Exact Matching; College Access; Experimental Design; Social Class; Educational Assessment, Evaluation, and Research; Higher Education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gaertner, M. N. (2011). Assessing a New Approach to Class-Based Affirmative Action. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/educ_gradetds/11

Chicago Manual of Style (16th Edition):

Gaertner, Matthew Newman. “Assessing a New Approach to Class-Based Affirmative Action.” 2011. Doctoral Dissertation, University of Colorado. Accessed April 22, 2021. https://scholar.colorado.edu/educ_gradetds/11.

MLA Handbook (7th Edition):

Gaertner, Matthew Newman. “Assessing a New Approach to Class-Based Affirmative Action.” 2011. Web. 22 Apr 2021.

Vancouver:

Gaertner MN. Assessing a New Approach to Class-Based Affirmative Action. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2021 Apr 22]. Available from: https://scholar.colorado.edu/educ_gradetds/11.

Council of Science Editors:

Gaertner MN. Assessing a New Approach to Class-Based Affirmative Action. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/educ_gradetds/11


Brno University of Technology

5. Šimeček, Josef. Inference v Bayesovských sítích: Inference in Bayesian Networks.

Degree: 2018, Brno University of Technology

 This master's thesis deals with demonstration of various approaches to probabilistic inference in Bayesian networks. Basics of probability theory, introduction to Bayesian networks, methods for… (more)

Subjects/Keywords: Bayesovské sítě; pravděpodobnostní inference; exaktní inference; Kimův a Pearlův algoritmus posílání zpráv; transformace na rozložitelný model; logické vzorkování; věrohodnostní váhování; Gibbsovo vzorkování; Bayesian networks; probabilistic inference; exact inference; Kim and Pearl's message passing algorithm; junction tree algorithm; logic sampling; likelihood weighting; Gibbs sampling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Šimeček, J. (2018). Inference v Bayesovských sítích: Inference in Bayesian Networks. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53484

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

Šimeček, Josef. “Inference v Bayesovských sítích: Inference in Bayesian Networks.” 2018. Thesis, Brno University of Technology. Accessed April 22, 2021. http://hdl.handle.net/11012/53484.

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

MLA Handbook (7th Edition):

Šimeček, Josef. “Inference v Bayesovských sítích: Inference in Bayesian Networks.” 2018. Web. 22 Apr 2021.

Vancouver:

Šimeček J. Inference v Bayesovských sítích: Inference in Bayesian Networks. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Apr 22]. Available from: http://hdl.handle.net/11012/53484.

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

Council of Science Editors:

Šimeček J. Inference v Bayesovských sítích: Inference in Bayesian Networks. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53484

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

6. Cortijo Aragon, Santiago José. Sécurité pour des infrastructures critiques SCADA fondée sur des modèles graphiques probabilistes : Probabilistic graphical model-based security for SCADA critical infrastructures.

Degree: Docteur es, Informatique, 2018, Sorbonne université

Dans la présente thèse, deux nouveaux modèles basés sur les Réseaux Bayésiens (BN) sont proposés: les BN à densités conditionnelles tronquées (ctdBN) et les BN… (more)

Subjects/Keywords: Réseaux bayésiens hybrides; Fonctions de score; Apprentissage; Inférence exacte; SCADA; Cyber-sécurité; Hybrid Bayesian networks; Score functions; Learning; Exact inference; SCADA; Digital security; 519.54; 006.3

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cortijo Aragon, S. J. (2018). Sécurité pour des infrastructures critiques SCADA fondée sur des modèles graphiques probabilistes : Probabilistic graphical model-based security for SCADA critical infrastructures. (Doctoral Dissertation). Sorbonne université. Retrieved from http://www.theses.fr/2018SORUS502

Chicago Manual of Style (16th Edition):

Cortijo Aragon, Santiago José. “Sécurité pour des infrastructures critiques SCADA fondée sur des modèles graphiques probabilistes : Probabilistic graphical model-based security for SCADA critical infrastructures.” 2018. Doctoral Dissertation, Sorbonne université. Accessed April 22, 2021. http://www.theses.fr/2018SORUS502.

MLA Handbook (7th Edition):

Cortijo Aragon, Santiago José. “Sécurité pour des infrastructures critiques SCADA fondée sur des modèles graphiques probabilistes : Probabilistic graphical model-based security for SCADA critical infrastructures.” 2018. Web. 22 Apr 2021.

Vancouver:

Cortijo Aragon SJ. Sécurité pour des infrastructures critiques SCADA fondée sur des modèles graphiques probabilistes : Probabilistic graphical model-based security for SCADA critical infrastructures. [Internet] [Doctoral dissertation]. Sorbonne université; 2018. [cited 2021 Apr 22]. Available from: http://www.theses.fr/2018SORUS502.

Council of Science Editors:

Cortijo Aragon SJ. Sécurité pour des infrastructures critiques SCADA fondée sur des modèles graphiques probabilistes : Probabilistic graphical model-based security for SCADA critical infrastructures. [Doctoral Dissertation]. Sorbonne université; 2018. Available from: http://www.theses.fr/2018SORUS502


University of Southern California

7. Xia, Yinglong. Exploration of parallelism for probabilistic graphical models.

Degree: PhD, Computer Science, 2010, University of Southern California

 Probabilistic graphical models such as Bayesian networks and junction trees are widely used to compactly represent joint probability distributions. They have found applications in a… (more)

Subjects/Keywords: parallel computing; parallel algorithm; probabilistic graphical model; exact inference; multicore processor; scheduler

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xia, Y. (2010). Exploration of parallelism for probabilistic graphical models. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2647

Chicago Manual of Style (16th Edition):

Xia, Yinglong. “Exploration of parallelism for probabilistic graphical models.” 2010. Doctoral Dissertation, University of Southern California. Accessed April 22, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2647.

MLA Handbook (7th Edition):

Xia, Yinglong. “Exploration of parallelism for probabilistic graphical models.” 2010. Web. 22 Apr 2021.

Vancouver:

Xia Y. Exploration of parallelism for probabilistic graphical models. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2021 Apr 22]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2647.

Council of Science Editors:

Xia Y. Exploration of parallelism for probabilistic graphical models. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/420474/rec/2647

8. Felipe Iwao Takiyama. Algoritmos de inferência exata para modelos de primeira ordem.

Degree: 2014, University of São Paulo

Este trabalho descreve a implementação de algoritmos de inferência para modelos de primeira ordem. Três algoritmos foram implementados: ve, c-fove e ac-fove. Este último e… (more)

Subjects/Keywords: AC-FOVE; Algoritmo de eliminação de variáveis em primeira ordem; Algoritmo de inferência exata; AC-FOVE; Exact inference algorithm; First-order variable elimination algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Takiyama, F. I. (2014). Algoritmos de inferência exata para modelos de primeira ordem. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/

Chicago Manual of Style (16th Edition):

Takiyama, Felipe Iwao. “Algoritmos de inferência exata para modelos de primeira ordem.” 2014. Masters Thesis, University of São Paulo. Accessed April 22, 2021. http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/.

MLA Handbook (7th Edition):

Takiyama, Felipe Iwao. “Algoritmos de inferência exata para modelos de primeira ordem.” 2014. Web. 22 Apr 2021.

Vancouver:

Takiyama FI. Algoritmos de inferência exata para modelos de primeira ordem. [Internet] [Masters thesis]. University of São Paulo; 2014. [cited 2021 Apr 22]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/.

Council of Science Editors:

Takiyama FI. Algoritmos de inferência exata para modelos de primeira ordem. [Masters Thesis]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/

9. Higgins, Michael. Applications of Integer Programming Methods to Solve Statistical Problems.

Degree: Statistics, 2013, University of California – Berkeley

 Many problems in statistics are inherently discrete. When one of these problems also contains an optimization component, integer programming may be used to facilitate a… (more)

Subjects/Keywords: Statistics; Blocking; Causal inference; Election auditing; Exact inference; Experimental design; Integer programming

…12 Exact and conservative p-values for hypothetical maximum observed overstatements (… …Senate race. The LKP conservative p-values (PLKP ) are nearly identical to the exact… …46 vi List of Tables 3.1 Conservative and exact p-values for the hypothesis that the… …x28;2008b). Column 3: LKP conservative p-value. Column 4: exact p-value obtained by solving… …exact p-values in Table 3.1 (0.0159 for maximum MRO and 0.0189 for maximum observed taint… 

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

Higgins, M. (2013). Applications of Integer Programming Methods to Solve Statistical Problems. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1g55c77q

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

Higgins, Michael. “Applications of Integer Programming Methods to Solve Statistical Problems.” 2013. Thesis, University of California – Berkeley. Accessed April 22, 2021. http://www.escholarship.org/uc/item/1g55c77q.

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

MLA Handbook (7th Edition):

Higgins, Michael. “Applications of Integer Programming Methods to Solve Statistical Problems.” 2013. Web. 22 Apr 2021.

Vancouver:

Higgins M. Applications of Integer Programming Methods to Solve Statistical Problems. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2021 Apr 22]. Available from: http://www.escholarship.org/uc/item/1g55c77q.

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

Council of Science Editors:

Higgins M. Applications of Integer Programming Methods to Solve Statistical Problems. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/1g55c77q

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

.