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:(Kolmogorov complexity). Showing records 1 – 30 of 33 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Baylor University

1. Ewert, Winston. Algorithmic specified complexity.

Degree: PhD, Electrical and Computer Engineering., 2013, Baylor University

 Information theory is a well developed field, but does not capture the essence of what information is. Shannon Information captures something in its definition of… (more)

Subjects/Keywords: Information.; Algorithmic specified complexity.; Kolmogorov complexity.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ewert, W. (2013). Algorithmic specified complexity. (Doctoral Dissertation). Baylor University. Retrieved from http://hdl.handle.net/2104/8829

Chicago Manual of Style (16th Edition):

Ewert, Winston. “Algorithmic specified complexity.” 2013. Doctoral Dissertation, Baylor University. Accessed September 20, 2020. http://hdl.handle.net/2104/8829.

MLA Handbook (7th Edition):

Ewert, Winston. “Algorithmic specified complexity.” 2013. Web. 20 Sep 2020.

Vancouver:

Ewert W. Algorithmic specified complexity. [Internet] [Doctoral dissertation]. Baylor University; 2013. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/2104/8829.

Council of Science Editors:

Ewert W. Algorithmic specified complexity. [Doctoral Dissertation]. Baylor University; 2013. Available from: http://hdl.handle.net/2104/8829

2. Lutz, Neil J. Algorithmic information, fractal geometry, and distributed dynamics.

Degree: PhD, Computer Science, 2017, Rutgers University

This dissertation applies two distinct algorithmic perspectives to questions in the field of fractal geometry and dynamics. In Part I, we establish connections between algorithmic… (more)

Subjects/Keywords: Kolmogorov complexity

Kolmogorov complexity [57], a measure of algorithmic information. This effective… …dimensions are analogous to conditional Kolmogorov complexity and conditional entropy, and they… …independently developed Kolmogorov complexity at around the same time as Kolmogorov with somewhat… …2.2 Kolmogorov Complexity and Dimensions of Sequences Hausdorff and packing dimensions are… …later characterization based on Kolmogorov complexity, which we now define. Definition. The… 

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

Lutz, N. J. (2017). Algorithmic information, fractal geometry, and distributed dynamics. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55576/

Chicago Manual of Style (16th Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 20, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

MLA Handbook (7th Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Web. 20 Sep 2020.

Vancouver:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 20]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

Council of Science Editors:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/


Penn State University

3. Hudelson, William. Partial randomness and Kolmogorov complexity.

Degree: 2013, Penn State University

 Algorithmic randomness and Kolmogorov complexity provide a computational framework for the study of probability theory and information theory. In this dissertation we prove the following… (more)

Subjects/Keywords: randomness; algorithmic randomness; complexity; Kolmogorov complexity; computability; recursion theory; mathematical logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hudelson, W. (2013). Partial randomness and Kolmogorov complexity. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/17456

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

Hudelson, William. “Partial randomness and Kolmogorov complexity.” 2013. Thesis, Penn State University. Accessed September 20, 2020. https://submit-etda.libraries.psu.edu/catalog/17456.

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

MLA Handbook (7th Edition):

Hudelson, William. “Partial randomness and Kolmogorov complexity.” 2013. Web. 20 Sep 2020.

Vancouver:

Hudelson W. Partial randomness and Kolmogorov complexity. [Internet] [Thesis]. Penn State University; 2013. [cited 2020 Sep 20]. Available from: https://submit-etda.libraries.psu.edu/catalog/17456.

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

Council of Science Editors:

Hudelson W. Partial randomness and Kolmogorov complexity. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/17456

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


Université Montpellier II

4. Kaced, Tarik. Partage de secret et théorie algorithmique de l'information : Secret Sharing and Algorithmic Information Theory.

Degree: Docteur es, Informatique, 2012, Université Montpellier II

Notre travail sur le partage de secret se base sur les points de vue théoriques de la Théorie de l'Information de Shannon et de la… (more)

Subjects/Keywords: Partage de Secret; Théorie de l'Information; Complexité de Kolmogorov; Secret Sharing; Information Theory; Kolmogorov Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kaced, T. (2012). Partage de secret et théorie algorithmique de l'information : Secret Sharing and Algorithmic Information Theory. (Doctoral Dissertation). Université Montpellier II. Retrieved from http://www.theses.fr/2012MON20170

Chicago Manual of Style (16th Edition):

Kaced, Tarik. “Partage de secret et théorie algorithmique de l'information : Secret Sharing and Algorithmic Information Theory.” 2012. Doctoral Dissertation, Université Montpellier II. Accessed September 20, 2020. http://www.theses.fr/2012MON20170.

MLA Handbook (7th Edition):

Kaced, Tarik. “Partage de secret et théorie algorithmique de l'information : Secret Sharing and Algorithmic Information Theory.” 2012. Web. 20 Sep 2020.

Vancouver:

Kaced T. Partage de secret et théorie algorithmique de l'information : Secret Sharing and Algorithmic Information Theory. [Internet] [Doctoral dissertation]. Université Montpellier II; 2012. [cited 2020 Sep 20]. Available from: http://www.theses.fr/2012MON20170.

Council of Science Editors:

Kaced T. Partage de secret et théorie algorithmique de l'information : Secret Sharing and Algorithmic Information Theory. [Doctoral Dissertation]. Université Montpellier II; 2012. Available from: http://www.theses.fr/2012MON20170

5. Ευθυμίου, Κωνσταντίνος. On the assessment of manufacturing systems complexity.

Degree: 2013, University of Patras

Objective of the present study is the development of methods for the assessment of manufacturing systems complexity and the investigation of flexibility and complexity relationship.… (more)

Subjects/Keywords: Manufacturing systems; Complexity; Flexibility; Shannon entropy; Kolmogorov complexity; Automotive industry; 670.11; Συστήματα παραγωγής; Πολυπλοκότητα; Ευελιξία; Εντροπία Shannon; Πολυπλοκότητα Kolmogorov; Αυτοκινητοβιομηχανία

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ευθυμίου, . (2013). On the assessment of manufacturing systems complexity. (Doctoral Dissertation). University of Patras. Retrieved from http://hdl.handle.net/10889/6381

Chicago Manual of Style (16th Edition):

Ευθυμίου, Κωνσταντίνος. “On the assessment of manufacturing systems complexity.” 2013. Doctoral Dissertation, University of Patras. Accessed September 20, 2020. http://hdl.handle.net/10889/6381.

MLA Handbook (7th Edition):

Ευθυμίου, Κωνσταντίνος. “On the assessment of manufacturing systems complexity.” 2013. Web. 20 Sep 2020.

Vancouver:

Ευθυμίου . On the assessment of manufacturing systems complexity. [Internet] [Doctoral dissertation]. University of Patras; 2013. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/10889/6381.

Council of Science Editors:

Ευθυμίου . On the assessment of manufacturing systems complexity. [Doctoral Dissertation]. University of Patras; 2013. Available from: http://hdl.handle.net/10889/6381


Boston University

6. Epstein, Samuel Randall. Information and distances.

Degree: PhD, Computer Science, 2013, Boston University

 We prove all randomized sampling methods produce outliers. Given a computable measure P over natural numbers or infinite binary sequences, there is no method that… (more)

Subjects/Keywords: Computer science; Camera mouse; Kernel Semi-least Squares; Kolmogorov complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Epstein, S. R. (2013). Information and distances. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/13132

Chicago Manual of Style (16th Edition):

Epstein, Samuel Randall. “Information and distances.” 2013. Doctoral Dissertation, Boston University. Accessed September 20, 2020. http://hdl.handle.net/2144/13132.

MLA Handbook (7th Edition):

Epstein, Samuel Randall. “Information and distances.” 2013. Web. 20 Sep 2020.

Vancouver:

Epstein SR. Information and distances. [Internet] [Doctoral dissertation]. Boston University; 2013. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/2144/13132.

Council of Science Editors:

Epstein SR. Information and distances. [Doctoral Dissertation]. Boston University; 2013. Available from: http://hdl.handle.net/2144/13132


Iowa State University

7. Patterson, Brian. Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks.

Degree: 2011, Iowa State University

 Our work is centered around topics where we provide a new model or approach to a well-known paradigm. We provide a new lens through which… (more)

Subjects/Keywords: cellular automata; hidden variables; Kolmogorov complexity; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patterson, B. (2011). Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/10201

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

Patterson, Brian. “Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks.” 2011. Thesis, Iowa State University. Accessed September 20, 2020. https://lib.dr.iastate.edu/etd/10201.

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

MLA Handbook (7th Edition):

Patterson, Brian. “Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks.” 2011. Web. 20 Sep 2020.

Vancouver:

Patterson B. Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks. [Internet] [Thesis]. Iowa State University; 2011. [cited 2020 Sep 20]. Available from: https://lib.dr.iastate.edu/etd/10201.

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

Council of Science Editors:

Patterson B. Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks. [Thesis]. Iowa State University; 2011. Available from: https://lib.dr.iastate.edu/etd/10201

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

8. Murena, Pierre-Alexandre. Minimum complexity principle for knowledge transfer in artificial learning : Principe de minimum de complexité pour le transfert de connaissances en apprentissage artificiel.

Degree: Docteur es, Informatique, 2018, Université Paris-Saclay (ComUE)

Les méthodes classiques d'apprentissage automatique reposent souvent sur une hypothèse simple mais restrictive: les données du passé et du présent sont générées selon une même… (more)

Subjects/Keywords: Apprentissage automatique; Analogie; Complexité de Kolmogorov; Géométrie noneuclidienne; Machine learning; Analogy; Kolmogorov complexity; Non-Euclidean geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Murena, P. (2018). Minimum complexity principle for knowledge transfer in artificial learning : Principe de minimum de complexité pour le transfert de connaissances en apprentissage artificiel. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2018SACLT019

Chicago Manual of Style (16th Edition):

Murena, Pierre-Alexandre. “Minimum complexity principle for knowledge transfer in artificial learning : Principe de minimum de complexité pour le transfert de connaissances en apprentissage artificiel.” 2018. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed September 20, 2020. http://www.theses.fr/2018SACLT019.

MLA Handbook (7th Edition):

Murena, Pierre-Alexandre. “Minimum complexity principle for knowledge transfer in artificial learning : Principe de minimum de complexité pour le transfert de connaissances en apprentissage artificiel.” 2018. Web. 20 Sep 2020.

Vancouver:

Murena P. Minimum complexity principle for knowledge transfer in artificial learning : Principe de minimum de complexité pour le transfert de connaissances en apprentissage artificiel. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2018. [cited 2020 Sep 20]. Available from: http://www.theses.fr/2018SACLT019.

Council of Science Editors:

Murena P. Minimum complexity principle for knowledge transfer in artificial learning : Principe de minimum de complexité pour le transfert de connaissances en apprentissage artificiel. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2018. Available from: http://www.theses.fr/2018SACLT019


University of Waterloo

9. Mondol, Tiasa. Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity.

Degree: 2020, University of Waterloo

 The Kolmogorov Complexity of an object is incomputable. But built in its structure is a way to specify description methods of an object that is… (more)

Subjects/Keywords: kolmogorov complexity; music information retrieval; context free grammar; algorithmic information complexity; conditional information; Artificial intelligence; Musical applications; Computer sound processing; Musical analysis; Musical notation; Music; Data processing; Kolmogorov complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mondol, T. (2020). Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15689

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

Mondol, Tiasa. “Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity.” 2020. Thesis, University of Waterloo. Accessed September 20, 2020. http://hdl.handle.net/10012/15689.

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

MLA Handbook (7th Edition):

Mondol, Tiasa. “Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity.” 2020. Web. 20 Sep 2020.

Vancouver:

Mondol T. Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/10012/15689.

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

Council of Science Editors:

Mondol T. Style Recognition in Music with Context Free Grammars and Kolmogorov Complexity. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15689

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


Penn State University

10. Wasson, Ryan Douglas. Data Compression and Fractal Dimension for Measures.

Degree: 2015, Penn State University

 The ability to distinguish between data generated by random versus deterministic processes is necessary for scientific discovery. Various tools for achieving this goal exist in… (more)

Subjects/Keywords: Kolmogorov complexity; Lempel-Ziv; fractal dimension; Hausdorff dimension; information dimension; multifractal spectrum

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wasson, R. D. (2015). Data Compression and Fractal Dimension for Measures. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/26517

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

Wasson, Ryan Douglas. “Data Compression and Fractal Dimension for Measures.” 2015. Thesis, Penn State University. Accessed September 20, 2020. https://submit-etda.libraries.psu.edu/catalog/26517.

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

MLA Handbook (7th Edition):

Wasson, Ryan Douglas. “Data Compression and Fractal Dimension for Measures.” 2015. Web. 20 Sep 2020.

Vancouver:

Wasson RD. Data Compression and Fractal Dimension for Measures. [Internet] [Thesis]. Penn State University; 2015. [cited 2020 Sep 20]. Available from: https://submit-etda.libraries.psu.edu/catalog/26517.

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

Council of Science Editors:

Wasson RD. Data Compression and Fractal Dimension for Measures. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/26517

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


Utah State University

11. Mohamadlou, Hamid. Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation.

Degree: PhD, Computer Science, 2015, Utah State University

  Algorithmic Information Theory (AIT), also known as Kolmogorov complexity, is a quantitative approach to defining information. AIT is mainly used to measure the amount… (more)

Subjects/Keywords: Algorithmic Information Theory; Kolmogorov complexity; Bright field cell; image segmentation; Gene Regulatory Network; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohamadlou, H. (2015). Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation. (Doctoral Dissertation). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/4539

Chicago Manual of Style (16th Edition):

Mohamadlou, Hamid. “Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation.” 2015. Doctoral Dissertation, Utah State University. Accessed September 20, 2020. https://digitalcommons.usu.edu/etd/4539.

MLA Handbook (7th Edition):

Mohamadlou, Hamid. “Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation.” 2015. Web. 20 Sep 2020.

Vancouver:

Mohamadlou H. Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation. [Internet] [Doctoral dissertation]. Utah State University; 2015. [cited 2020 Sep 20]. Available from: https://digitalcommons.usu.edu/etd/4539.

Council of Science Editors:

Mohamadlou H. Algorithmic Information Theory Applications in Bright Field Microscopy and Epithelial Pattern Formation. [Doctoral Dissertation]. Utah State University; 2015. Available from: https://digitalcommons.usu.edu/etd/4539

12. Herbert, Ian-Cadoc Robertson. Weak Lowness Notions for Kolmogorov Complexity.

Degree: Logic & the Methodology of Science, 2013, University of California – Berkeley

 The prefix-free Kolmogorov complexity, K(σ), of a finite binary string σ is the length of the shortest self-delimiting program that outputs σ and is a… (more)

Subjects/Keywords: Logic; Mathematics; Kolmogorov Complexity; Randomness; Recursion Theory

…a short overview. The essential idea in this approach is to use Kolmogorov complexity to… …examine the information content of reals. Intuitively, the prefix-free Kolmogorov complexity of… …randomness using Kolmogorov complexity gives us a notion of being ‘far from random:’ those reals… …x28;prefix-free) Kolmogorov complexity relative to M. Intuitively, this represents the… …free) Kolmogorov complexity of σ, is K(σ) = min{|τ |: U(τ ) = σ… 

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

Herbert, I. R. (2013). Weak Lowness Notions for Kolmogorov Complexity. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/0q79m72q

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

Herbert, Ian-Cadoc Robertson. “Weak Lowness Notions for Kolmogorov Complexity.” 2013. Thesis, University of California – Berkeley. Accessed September 20, 2020. http://www.escholarship.org/uc/item/0q79m72q.

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

MLA Handbook (7th Edition):

Herbert, Ian-Cadoc Robertson. “Weak Lowness Notions for Kolmogorov Complexity.” 2013. Web. 20 Sep 2020.

Vancouver:

Herbert IR. Weak Lowness Notions for Kolmogorov Complexity. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2020 Sep 20]. Available from: http://www.escholarship.org/uc/item/0q79m72q.

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

Council of Science Editors:

Herbert IR. Weak Lowness Notions for Kolmogorov Complexity. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/0q79m72q

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


KTH

13. Norgren, Lee. Segmenting Observed Time Series Using Comovement and Complexity Measures.

Degree: Mathematical Statistics, 2019, KTH

Society depends on unbiased, efficient and replicable measurement tools to tell us more truthfully what is happening when our senses would otherwise fool us.… (more)

Subjects/Keywords: Time Series; Correlation; Baur Comovement; Kolmogorov Complexity; Tidsserie; Korrelation; Baur Comovement; Kolmogorovkomplexitet; Probability Theory and Statistics; Sannolikhetsteori och statistik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Norgren, L. (2019). Segmenting Observed Time Series Using Comovement and Complexity Measures. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252571

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

Norgren, Lee. “Segmenting Observed Time Series Using Comovement and Complexity Measures.” 2019. Thesis, KTH. Accessed September 20, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252571.

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

MLA Handbook (7th Edition):

Norgren, Lee. “Segmenting Observed Time Series Using Comovement and Complexity Measures.” 2019. Web. 20 Sep 2020.

Vancouver:

Norgren L. Segmenting Observed Time Series Using Comovement and Complexity Measures. [Internet] [Thesis]. KTH; 2019. [cited 2020 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252571.

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

Council of Science Editors:

Norgren L. Segmenting Observed Time Series Using Comovement and Complexity Measures. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252571

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

14. Nikvand, Nima. Image Information Distance Analysis and Applications.

Degree: 2014, University of Waterloo

 Image similarity or distortion assessment is fundamental to a broad range of applications throughout the field of image processing and machine vision. These include image… (more)

Subjects/Keywords: Kolmogorov Complexity; Information Distance; Image; Similarity; Quality

…3 Generic Image Similarity Metric based on Kolmogorov Complexity 31 3.1 Normalized… …48 4 Entropy Approximation of Kolmogorov Complexity with Applications 52 3.6 4.1… …Shannon Entropy and Kolmogorov Complexity . . . . . . . . . . . . . . . . 4.2 Normalized… …work is largely inspired by the theory of Kolmogorov Complexity (KC). Kolmogorov… …Kolmogorov complexity is non-computable and is usually approximated using a practical data… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nikvand, N. (2014). Image Information Distance Analysis and Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8321

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

Nikvand, Nima. “Image Information Distance Analysis and Applications.” 2014. Thesis, University of Waterloo. Accessed September 20, 2020. http://hdl.handle.net/10012/8321.

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

MLA Handbook (7th Edition):

Nikvand, Nima. “Image Information Distance Analysis and Applications.” 2014. Web. 20 Sep 2020.

Vancouver:

Nikvand N. Image Information Distance Analysis and Applications. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/10012/8321.

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

Council of Science Editors:

Nikvand N. Image Information Distance Analysis and Applications. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8321

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

15. Saillenfest, Antoine. Modélisation cognitive de la pertinence narrative en vue de l'évaluation et de la génération de récits : Cognitive modeling of narrative relevance : towards the evaluation and the generation of stories.

Degree: Docteur es, Informatique et réseaux, 2015, Paris, ENST

Une part importante de l’activité de communication humaine est dédiée au récit d’événements (fictifs ou non). Ces récits doivent être cohérents et intéressants pour être… (more)

Subjects/Keywords: Pertinence narrative; Complexité de Kolmogorov; Complexité cognitive; Inattendu; Intérêt; Crédibilité; Postdictibilité; Conflit cognitif; Suspense; Jugement moral; Génération automatique de récits; Probabilité subjective; Abduction; Narrative relevance; Kolmogorov complexity; Cognitive complexity; Unexpectedness; Interest; Believability; Postdictability; Cognitive conflict; Suspense; Moral judgment; Automatic story generation; Subjective probability; Abduction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saillenfest, A. (2015). Modélisation cognitive de la pertinence narrative en vue de l'évaluation et de la génération de récits : Cognitive modeling of narrative relevance : towards the evaluation and the generation of stories. (Doctoral Dissertation). Paris, ENST. Retrieved from http://www.theses.fr/2015ENST0073

Chicago Manual of Style (16th Edition):

Saillenfest, Antoine. “Modélisation cognitive de la pertinence narrative en vue de l'évaluation et de la génération de récits : Cognitive modeling of narrative relevance : towards the evaluation and the generation of stories.” 2015. Doctoral Dissertation, Paris, ENST. Accessed September 20, 2020. http://www.theses.fr/2015ENST0073.

MLA Handbook (7th Edition):

Saillenfest, Antoine. “Modélisation cognitive de la pertinence narrative en vue de l'évaluation et de la génération de récits : Cognitive modeling of narrative relevance : towards the evaluation and the generation of stories.” 2015. Web. 20 Sep 2020.

Vancouver:

Saillenfest A. Modélisation cognitive de la pertinence narrative en vue de l'évaluation et de la génération de récits : Cognitive modeling of narrative relevance : towards the evaluation and the generation of stories. [Internet] [Doctoral dissertation]. Paris, ENST; 2015. [cited 2020 Sep 20]. Available from: http://www.theses.fr/2015ENST0073.

Council of Science Editors:

Saillenfest A. Modélisation cognitive de la pertinence narrative en vue de l'évaluation et de la génération de récits : Cognitive modeling of narrative relevance : towards the evaluation and the generation of stories. [Doctoral Dissertation]. Paris, ENST; 2015. Available from: http://www.theses.fr/2015ENST0073

16. Mimić Gordan. Nelinearna dinamička analiza fizičkih procesa u žiivotnoj sredini.

Degree: 2016, University of Novi Sad

Ispitivan  je  spregnut  sistem  jednačina  za  prognozu  temperature  na površini  i  u  dubljem sloju zemljišta.  Računati  su  Ljapunovljevi eksponenti,  bifurkacioni dijagram, atraktor i analiziran… (more)

Subjects/Keywords: haos, informacione mere, nasumičnost, entropija, Kolmogorovljeva kompleksnost, Lempel-Zivov algoritam, vremenske serije; chaos, information measures, randomness, entropy, Kolmogorov complexity, Lempel-Ziv algorithm, time series

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gordan, M. (2016). Nelinearna dinamička analiza fizičkih procesa u žiivotnoj sredini. (Thesis). University of Novi Sad. Retrieved from https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146616250985411.pdf?controlNumber=(BISIS)101258&fileName=146616250985411.pdf&id=6057&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101258&source=OATD&language=en

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

Gordan, Mimić. “Nelinearna dinamička analiza fizičkih procesa u žiivotnoj sredini.” 2016. Thesis, University of Novi Sad. Accessed September 20, 2020. https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146616250985411.pdf?controlNumber=(BISIS)101258&fileName=146616250985411.pdf&id=6057&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101258&source=OATD&language=en.

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

MLA Handbook (7th Edition):

Gordan, Mimić. “Nelinearna dinamička analiza fizičkih procesa u žiivotnoj sredini.” 2016. Web. 20 Sep 2020.

Vancouver:

Gordan M. Nelinearna dinamička analiza fizičkih procesa u žiivotnoj sredini. [Internet] [Thesis]. University of Novi Sad; 2016. [cited 2020 Sep 20]. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146616250985411.pdf?controlNumber=(BISIS)101258&fileName=146616250985411.pdf&id=6057&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101258&source=OATD&language=en.

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

Council of Science Editors:

Gordan M. Nelinearna dinamička analiza fizičkih procesa u žiivotnoj sredini. [Thesis]. University of Novi Sad; 2016. Available from: https://www.cris.uns.ac.rs/DownloadFileServlet/Disertacija146616250985411.pdf?controlNumber=(BISIS)101258&fileName=146616250985411.pdf&id=6057&source=OATD&language=en ; https://www.cris.uns.ac.rs/record.jsf?recordId=101258&source=OATD&language=en

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


Indiana University

17. Teutsch, Jason Richmond. Noncomputable Spectral Sets .

Degree: 2010, Indiana University

 It is a basic fact that, given a computer language and a computable integer function, there exists a shortest program in that language which computes… (more)

Subjects/Keywords: computability theory; minimal indices; shortest programs; Godel numberings; Turing degrees; immunity; Kolmogorov complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Teutsch, J. R. (2010). Noncomputable Spectral Sets . (Thesis). Indiana University. Retrieved from http://hdl.handle.net/2022/7345

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

Teutsch, Jason Richmond. “Noncomputable Spectral Sets .” 2010. Thesis, Indiana University. Accessed September 20, 2020. http://hdl.handle.net/2022/7345.

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

MLA Handbook (7th Edition):

Teutsch, Jason Richmond. “Noncomputable Spectral Sets .” 2010. Web. 20 Sep 2020.

Vancouver:

Teutsch JR. Noncomputable Spectral Sets . [Internet] [Thesis]. Indiana University; 2010. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/2022/7345.

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

Council of Science Editors:

Teutsch JR. Noncomputable Spectral Sets . [Thesis]. Indiana University; 2010. Available from: http://hdl.handle.net/2022/7345

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

18. Rooij, Steven. Minimum Description Length Model Selection - Problems and Extensions.

Degree: 2008, NARCIS

htmlabstractThe thesis treats a number of open problems in Minimum Description Length model selection, especially prediction problems. It is shown how techniques from the "Prediction with Expert Advice" literature can be used to improve model selection performance, which is particularly useful in nonparametric settings.

Subjects/Keywords: model selection; minimum description length; prediction with expert advice; kolmogorov complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rooij, S. (2008). Minimum Description Length Model Selection - Problems and Extensions. (Doctoral Dissertation). NARCIS. Retrieved from https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; urn:isbn:978-90-5776-181 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369

Chicago Manual of Style (16th Edition):

Rooij, Steven. “Minimum Description Length Model Selection - Problems and Extensions.” 2008. Doctoral Dissertation, NARCIS. Accessed September 20, 2020. https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; urn:isbn:978-90-5776-181 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369.

MLA Handbook (7th Edition):

Rooij, Steven. “Minimum Description Length Model Selection - Problems and Extensions.” 2008. Web. 20 Sep 2020.

Vancouver:

Rooij S. Minimum Description Length Model Selection - Problems and Extensions. [Internet] [Doctoral dissertation]. NARCIS; 2008. [cited 2020 Sep 20]. Available from: https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; urn:isbn:978-90-5776-181 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369.

Council of Science Editors:

Rooij S. Minimum Description Length Model Selection - Problems and Extensions. [Doctoral Dissertation]. NARCIS; 2008. Available from: https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369 ; urn:NBN:nl:ui:18-13369 ; urn:isbn:978-90-5776-181 ; urn:NBN:nl:ui:18-13369 ; https://ir.cwi.nl/pub/13369


University of Central Florida

19. Cintron, Jose. A Framework For Measuring The Value-added Of Knowledge Processes With Analysis Of Process Interactions And Dynamics.

Degree: 2013, University of Central Florida

 The most known and widely used methods use cash flows and tangible assets to measure the impact of investments in the organization’s outputs. But in… (more)

Subjects/Keywords: Intangibles; kolmogorov; complexity; knowledge value added; matrix of change; system dynamics; Engineering; Industrial Engineering; Dissertations, Academic  – Engineering and Computer Science, Engineering and Computer Science  – Dissertations, Academic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cintron, J. (2013). A Framework For Measuring The Value-added Of Knowledge Processes With Analysis Of Process Interactions And Dynamics. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/2739

Chicago Manual of Style (16th Edition):

Cintron, Jose. “A Framework For Measuring The Value-added Of Knowledge Processes With Analysis Of Process Interactions And Dynamics.” 2013. Doctoral Dissertation, University of Central Florida. Accessed September 20, 2020. https://stars.library.ucf.edu/etd/2739.

MLA Handbook (7th Edition):

Cintron, Jose. “A Framework For Measuring The Value-added Of Knowledge Processes With Analysis Of Process Interactions And Dynamics.” 2013. Web. 20 Sep 2020.

Vancouver:

Cintron J. A Framework For Measuring The Value-added Of Knowledge Processes With Analysis Of Process Interactions And Dynamics. [Internet] [Doctoral dissertation]. University of Central Florida; 2013. [cited 2020 Sep 20]. Available from: https://stars.library.ucf.edu/etd/2739.

Council of Science Editors:

Cintron J. A Framework For Measuring The Value-added Of Knowledge Processes With Analysis Of Process Interactions And Dynamics. [Doctoral Dissertation]. University of Central Florida; 2013. Available from: https://stars.library.ucf.edu/etd/2739

20. Carr, Jon William. Induction and interaction in the evolution of language and conceptual structure.

Degree: PhD, 2019, University of Edinburgh

 Languages evolve in response to various pressures, and this thesis adopts the view that two pressures are especially important. Firstly, the process of learning a… (more)

Subjects/Keywords: Bayes; categorization; category learning; communication; complexity; compositionality; compression; concept learning; convexity; cultural evolution; cultural transmission; expressivity; generalization; induction; informativeness; interaction; iterated learning; Kolmogorov complexity; language evolution; minimum description length; semantic categories; simplicity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carr, J. W. (2019). Induction and interaction in the evolution of language and conceptual structure. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/35648

Chicago Manual of Style (16th Edition):

Carr, Jon William. “Induction and interaction in the evolution of language and conceptual structure.” 2019. Doctoral Dissertation, University of Edinburgh. Accessed September 20, 2020. http://hdl.handle.net/1842/35648.

MLA Handbook (7th Edition):

Carr, Jon William. “Induction and interaction in the evolution of language and conceptual structure.” 2019. Web. 20 Sep 2020.

Vancouver:

Carr JW. Induction and interaction in the evolution of language and conceptual structure. [Internet] [Doctoral dissertation]. University of Edinburgh; 2019. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1842/35648.

Council of Science Editors:

Carr JW. Induction and interaction in the evolution of language and conceptual structure. [Doctoral Dissertation]. University of Edinburgh; 2019. Available from: http://hdl.handle.net/1842/35648


University of North Texas

21. Yang, Jin. A Dynamic and Thermodynamic Approach to Complexity.

Degree: 2003, University of North Texas

 The problem of establishing the correct approach to complexity is a very hot and crucial issue to which this dissertation gives some contributions. This dissertation… (more)

Subjects/Keywords: Kolmogorov complexity.; Computational complexity.; Dynamics.; Thermodynamics.; Kolmogorow-Sinai entropy; Pesin theorem; diffusion entropy; wavelet transform maximum modulus; multifractals

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, J. (2003). A Dynamic and Thermodynamic Approach to Complexity. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc4276/

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

Chicago Manual of Style (16th Edition):

Yang, Jin. “A Dynamic and Thermodynamic Approach to Complexity.” 2003. Thesis, University of North Texas. Accessed September 20, 2020. https://digital.library.unt.edu/ark:/67531/metadc4276/.

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

MLA Handbook (7th Edition):

Yang, Jin. “A Dynamic and Thermodynamic Approach to Complexity.” 2003. Web. 20 Sep 2020.

Vancouver:

Yang J. A Dynamic and Thermodynamic Approach to Complexity. [Internet] [Thesis]. University of North Texas; 2003. [cited 2020 Sep 20]. Available from: https://digital.library.unt.edu/ark:/67531/metadc4276/.

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

Council of Science Editors:

Yang J. A Dynamic and Thermodynamic Approach to Complexity. [Thesis]. University of North Texas; 2003. Available from: https://digital.library.unt.edu/ark:/67531/metadc4276/

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


University of Victoria

22. Rebenich, Niko. Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.

Degree: Dept. of Electrical and Computer Engineering, 2012, University of Victoria

 This thesis presents flott, the Fast Low Memory T-Transform, the currently fastest and most memory efficient linear time and space algorithm available to compute the… (more)

Subjects/Keywords: Kolmogorov complexity; Lempel; Ziv; T-codes; flott; Fast T-decomposition; ftd; mobile computing; Lempel-Ziv complexity; LZ complexity; LZ78; LZ77; LZ76; LZW; normalized information distance; NID; normalized compression distance; NCD; McCreight; Ukkonen; phylogenetics; phylogenetic tree; Gemini; Droiddream; Apple; iOS; iPhone; iPad; mobile phone; open source; Apache License 2.0

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rebenich, N. (2012). Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/3924

Chicago Manual of Style (16th Edition):

Rebenich, Niko. “Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.” 2012. Masters Thesis, University of Victoria. Accessed September 20, 2020. http://hdl.handle.net/1828/3924.

MLA Handbook (7th Edition):

Rebenich, Niko. “Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security.” 2012. Web. 20 Sep 2020.

Vancouver:

Rebenich N. Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security. [Internet] [Masters thesis]. University of Victoria; 2012. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1828/3924.

Council of Science Editors:

Rebenich N. Fast Low Memory T-Transform: string complexity in linear time and space with applications to Android app store security. [Masters Thesis]. University of Victoria; 2012. Available from: http://hdl.handle.net/1828/3924


University of Rochester

23. Zimand, Marius. Existential Theorems in Computational Complexity Theory: Size and Robustness.

Degree: PhD, 2004, University of Rochester

 How strong are the results in computational complexity that assert, under certain hypotheses, the existence of an object? Are there many such objects, or are… (more)

Subjects/Keywords: p-selective sets; pseudo-random generator; Kolmogorov complexity; AC^0; NP optimization problems; descriptive complexity; approximation algorithms; computational complexity; abstract complexity; gap theorem; polynomial-degrees; random oracle; one-way functions; speed-up theorem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zimand, M. (2004). Existential Theorems in Computational Complexity Theory: Size and Robustness. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/818

Chicago Manual of Style (16th Edition):

Zimand, Marius. “Existential Theorems in Computational Complexity Theory: Size and Robustness.” 2004. Doctoral Dissertation, University of Rochester. Accessed September 20, 2020. http://hdl.handle.net/1802/818.

MLA Handbook (7th Edition):

Zimand, Marius. “Existential Theorems in Computational Complexity Theory: Size and Robustness.” 2004. Web. 20 Sep 2020.

Vancouver:

Zimand M. Existential Theorems in Computational Complexity Theory: Size and Robustness. [Internet] [Doctoral dissertation]. University of Rochester; 2004. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1802/818.

Council of Science Editors:

Zimand M. Existential Theorems in Computational Complexity Theory: Size and Robustness. [Doctoral Dissertation]. University of Rochester; 2004. Available from: http://hdl.handle.net/1802/818

24. Campana, Bilson Jake. Pattern-Based Data Mining on Diverse Multimedia and Time Series Data.

Degree: Computer Science, 2012, University of California – Riverside

 The ubiquity of patterns in data mining and knowledge discovery data sets is a binding characteristic across a diverse, and possibly otherwise unrelated, range of… (more)

Subjects/Keywords: Computer science; Classification; Compression; Image Similarity; Kolmogorov Complexity; Minimum Description Length; Rule Discovery

…8 2) Kolmogorov Complexity Inspired Distance Measures… …work we propose to extend recent advances in Kolmogorov complexity-based similarity measures… …by approximating the Kolmogorov complexity with the Campana-Keogh (CK) method of… …in image and texture analysis, Kolmogorov complexity, and compression based measures. 1… …and orders of magnitude faster. 2) Kolmogorov Complexity Inspired Distance Measures… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Campana, B. J. (2012). Pattern-Based Data Mining on Diverse Multimedia and Time Series Data. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/0nm5g0vm

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

Campana, Bilson Jake. “Pattern-Based Data Mining on Diverse Multimedia and Time Series Data.” 2012. Thesis, University of California – Riverside. Accessed September 20, 2020. http://www.escholarship.org/uc/item/0nm5g0vm.

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

MLA Handbook (7th Edition):

Campana, Bilson Jake. “Pattern-Based Data Mining on Diverse Multimedia and Time Series Data.” 2012. Web. 20 Sep 2020.

Vancouver:

Campana BJ. Pattern-Based Data Mining on Diverse Multimedia and Time Series Data. [Internet] [Thesis]. University of California – Riverside; 2012. [cited 2020 Sep 20]. Available from: http://www.escholarship.org/uc/item/0nm5g0vm.

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

Council of Science Editors:

Campana BJ. Pattern-Based Data Mining on Diverse Multimedia and Time Series Data. [Thesis]. University of California – Riverside; 2012. Available from: http://www.escholarship.org/uc/item/0nm5g0vm

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


Stockholm University

25. Everitt, Tom. Universal Induction and Optimisation: No Free Lunch.

Degree: Mathematics, 2013, Stockholm University

Subjects/Keywords: No Free Lunch; Black-box Optimisation; Universal Distribution; Solomonoff induction; Kolmogorov complexity; Mathematics; Matematik; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Everitt, T. (2013). Universal Induction and Optimisation: No Free Lunch. (Thesis). Stockholm University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-112785

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

Everitt, Tom. “Universal Induction and Optimisation: No Free Lunch.” 2013. Thesis, Stockholm University. Accessed September 20, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-112785.

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

MLA Handbook (7th Edition):

Everitt, Tom. “Universal Induction and Optimisation: No Free Lunch.” 2013. Web. 20 Sep 2020.

Vancouver:

Everitt T. Universal Induction and Optimisation: No Free Lunch. [Internet] [Thesis]. Stockholm University; 2013. [cited 2020 Sep 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-112785.

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

Council of Science Editors:

Everitt T. Universal Induction and Optimisation: No Free Lunch. [Thesis]. Stockholm University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-112785

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


University of Melbourne

26. Pescod, Neil Richard. Using a non-universal logic as a foundation for statistical inference and induction.

Degree: 2006, University of Melbourne

 The aim of this thesis is to develop a probabilistic form of inference that can treat the problem of induction in a statistically rigorous manner.… (more)

Subjects/Keywords: Algebraic logic; Bayesian statistical decision theory; Entailment (Logic); Induction (Logic); Kolmogorov complexity; Logic, symbolic and mathematical; Quantum logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pescod, N. R. (2006). Using a non-universal logic as a foundation for statistical inference and induction. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/115090

Chicago Manual of Style (16th Edition):

Pescod, Neil Richard. “Using a non-universal logic as a foundation for statistical inference and induction.” 2006. Masters Thesis, University of Melbourne. Accessed September 20, 2020. http://hdl.handle.net/11343/115090.

MLA Handbook (7th Edition):

Pescod, Neil Richard. “Using a non-universal logic as a foundation for statistical inference and induction.” 2006. Web. 20 Sep 2020.

Vancouver:

Pescod NR. Using a non-universal logic as a foundation for statistical inference and induction. [Internet] [Masters thesis]. University of Melbourne; 2006. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/11343/115090.

Council of Science Editors:

Pescod NR. Using a non-universal logic as a foundation for statistical inference and induction. [Masters Thesis]. University of Melbourne; 2006. Available from: http://hdl.handle.net/11343/115090

27. Bauwens, Bruno. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.

Degree: 2010, Ghent University

Subjects/Keywords: Mathematics and Statistics; Computability theory; minimal sufficient statistics; influence in time series; statistical hypothesis testing; ideal sequence analysis; Kolmogorov complexity; causality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bauwens, B. (2010). Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-1107852

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

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Thesis, Ghent University. Accessed September 20, 2020. http://hdl.handle.net/1854/LU-1107852.

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

MLA Handbook (7th Edition):

Bauwens, Bruno. “Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity.” 2010. Web. 20 Sep 2020.

Vancouver:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Internet] [Thesis]. Ghent University; 2010. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1854/LU-1107852.

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

Council of Science Editors:

Bauwens B. Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. [Thesis]. Ghent University; 2010. Available from: http://hdl.handle.net/1854/LU-1107852

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


Queens University

28. Rahmati, Sara. The Universal Similarity Metric, Applied to Contact Maps Comparison in A Two-Dimensional Space .

Degree: Computing, 2008, Queens University

 Comparing protein structures based on their contact maps is an important problem in structural proteomics. Building a system for reconstructing protein tertiary structures from their… (more)

Subjects/Keywords: bioinformatics ; proteomics ; kolmogorov complexity ; universal similarity metric ; protein contact map ; contact map comparison ; protein structure prediction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rahmati, S. (2008). The Universal Similarity Metric, Applied to Contact Maps Comparison in A Two-Dimensional Space . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/1484

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

Rahmati, Sara. “The Universal Similarity Metric, Applied to Contact Maps Comparison in A Two-Dimensional Space .” 2008. Thesis, Queens University. Accessed September 20, 2020. http://hdl.handle.net/1974/1484.

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

MLA Handbook (7th Edition):

Rahmati, Sara. “The Universal Similarity Metric, Applied to Contact Maps Comparison in A Two-Dimensional Space .” 2008. Web. 20 Sep 2020.

Vancouver:

Rahmati S. The Universal Similarity Metric, Applied to Contact Maps Comparison in A Two-Dimensional Space . [Internet] [Thesis]. Queens University; 2008. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1974/1484.

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

Council of Science Editors:

Rahmati S. The Universal Similarity Metric, Applied to Contact Maps Comparison in A Two-Dimensional Space . [Thesis]. Queens University; 2008. Available from: http://hdl.handle.net/1974/1484

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


Indian Institute of Science

29. Kallol, Roy. Quantum Algorithmic Engineering with Photonic Integrated Circuits.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 Integrated quantum photonics show monolithic waveguide chips to be a promising platform for realizing the next generation of quantum optical circuits. This work proposes the… (more)

Subjects/Keywords: Integrated Quantum Photonics; Quantum Algorithms; Photonic Integrated Circuits; Quantum Stochasic Walk; Photonic Waveguide Lattice; Quantum Cryptography; Quantum PageRank Algorithm; Quantum Walk Based Open Graph Search; Facebook Open Graph Search; Quantum Walk on Graph; Quantum Algorithm Encoding; Kolmogorov Complexity; Google Quantum PageRank; Photonic Lattice; Quantum Decoherence; Quantum Circuits; Electronic Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kallol, R. (2018). Quantum Algorithmic Engineering with Photonic Integrated Circuits. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3451

Chicago Manual of Style (16th Edition):

Kallol, Roy. “Quantum Algorithmic Engineering with Photonic Integrated Circuits.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed September 20, 2020. http://etd.iisc.ac.in/handle/2005/3451.

MLA Handbook (7th Edition):

Kallol, Roy. “Quantum Algorithmic Engineering with Photonic Integrated Circuits.” 2018. Web. 20 Sep 2020.

Vancouver:

Kallol R. Quantum Algorithmic Engineering with Photonic Integrated Circuits. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2020 Sep 20]. Available from: http://etd.iisc.ac.in/handle/2005/3451.

Council of Science Editors:

Kallol R. Quantum Algorithmic Engineering with Photonic Integrated Circuits. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3451


Université de Montréal

30. Berthelette, Sophie. Complexité de Kolmogorov et corrélations quantiques; étude du carré magique.

Degree: 2020, Université de Montréal

Subjects/Keywords: corrélations quantiques; informatique quantique; intrication; complexité de Kolmogorov; théorème des répétitions parallèles; boîtes Popescu-Rohrlich; carré magique; Quantum correlations; Quantum information; Entanglement; Kolmogorov complexity; Parallel repetition theorem; Popescu-Rohrlich boxes; Magic square; Physics - Theory / Physique - Théorie (UMI : 0753)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berthelette, S. (2020). Complexité de Kolmogorov et corrélations quantiques; étude du carré magique. (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/23810

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

Berthelette, Sophie. “Complexité de Kolmogorov et corrélations quantiques; étude du carré magique.” 2020. Thesis, Université de Montréal. Accessed September 20, 2020. http://hdl.handle.net/1866/23810.

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

MLA Handbook (7th Edition):

Berthelette, Sophie. “Complexité de Kolmogorov et corrélations quantiques; étude du carré magique.” 2020. Web. 20 Sep 2020.

Vancouver:

Berthelette S. Complexité de Kolmogorov et corrélations quantiques; étude du carré magique. [Internet] [Thesis]. Université de Montréal; 2020. [cited 2020 Sep 20]. Available from: http://hdl.handle.net/1866/23810.

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

Council of Science Editors:

Berthelette S. Complexité de Kolmogorov et corrélations quantiques; étude du carré magique. [Thesis]. Université de Montréal; 2020. Available from: http://hdl.handle.net/1866/23810

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

[1] [2]

.