Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Computational complexity )`

.
Showing records 1 – 30 of
335 total matches.

◁ [1] [2] [3] [4] [5] … [12] ▶

Search Limiters

Dates

- 2016 – 2020 (106)
- 2011 – 2015 (126)
- 2006 – 2010 (73)
- 2001 – 2005 (27)
- 1996 – 2000 (12)

Universities

- University of Oxford (12)
- University of Victoria (11)
- University of Waterloo (11)

Department

- Computer Science (15)
- Informatique (12)

Degrees

- PhD (87)
- Docteur es (23)
- MS (19)

Levels

- doctoral (143)
- masters (36)
- doctor of philosophy ph.d. (11)

Languages

- English (201)
- French (12)
- Portuguese (12)
- Greek (11)

▼ Search Limiters

1.
Yatsko, Andrew.
Large dataset *complexity* reduction for classification: An optimization perspective.

Degree: PhD, 2012, Federation University Australia

URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/53517

►

Doctor of Philosophy

*Computational* *complexity* in data mining is attributed to algorithms but lies hugely with the data. Different algorithms may exist to solve the…
(more)

Subjects/Keywords: Computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yatsko, A. (2012). Large dataset complexity reduction for classification: An optimization perspective. (Doctoral Dissertation). Federation University Australia. Retrieved from http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/53517

Chicago Manual of Style (16^{th} Edition):

Yatsko, Andrew. “Large dataset complexity reduction for classification: An optimization perspective.” 2012. Doctoral Dissertation, Federation University Australia. Accessed December 01, 2020. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/53517.

MLA Handbook (7^{th} Edition):

Yatsko, Andrew. “Large dataset complexity reduction for classification: An optimization perspective.” 2012. Web. 01 Dec 2020.

Vancouver:

Yatsko A. Large dataset complexity reduction for classification: An optimization perspective. [Internet] [Doctoral dissertation]. Federation University Australia; 2012. [cited 2020 Dec 01]. Available from: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/53517.

Council of Science Editors:

Yatsko A. Large dataset complexity reduction for classification: An optimization perspective. [Doctoral Dissertation]. Federation University Australia; 2012. Available from: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/53517

University of Waterloo

2.
Tirdad, Kamran.
Exploiting the *Computational* Power of Ternary Content Addressable Memory.

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/6315

► Ternary Content Addressable Memory or in short TCAM is a special type of memory that can execute a certain set of operations in parallel on…
(more)

Subjects/Keywords: TCAM; Computational Complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tirdad, K. (2011). Exploiting the Computational Power of Ternary Content Addressable Memory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6315

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tirdad, Kamran. “Exploiting the Computational Power of Ternary Content Addressable Memory.” 2011. Thesis, University of Waterloo. Accessed December 01, 2020. http://hdl.handle.net/10012/6315.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tirdad, Kamran. “Exploiting the Computational Power of Ternary Content Addressable Memory.” 2011. Web. 01 Dec 2020.

Vancouver:

Tirdad K. Exploiting the Computational Power of Ternary Content Addressable Memory. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10012/6315.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tirdad K. Exploiting the Computational Power of Ternary Content Addressable Memory. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6315

Not specified: Masters Thesis or Doctoral Dissertation

University of Delaware

3.
Ralston, Michael.
Topics in computability, *complexity*, constructivity & provability: Topics in computability, *complexity*, constructivity and provability.

Degree: PhD, University of Delaware, Department of Computer and Information Sciences, 2014, University of Delaware

URL: http://udspace.udel.edu/handle/19716/13413

► The three content chapters of this doctoral dissertation involve each of the concepts Computability, *Complexity*, Constructivity & Provability from the title. One of these chapters…
(more)

Subjects/Keywords: Computational complexity.; Computer programs – Verification.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ralston, M. (2014). Topics in computability, complexity, constructivity & provability: Topics in computability, complexity, constructivity and provability. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/13413

Chicago Manual of Style (16^{th} Edition):

Ralston, Michael. “Topics in computability, complexity, constructivity & provability: Topics in computability, complexity, constructivity and provability.” 2014. Doctoral Dissertation, University of Delaware. Accessed December 01, 2020. http://udspace.udel.edu/handle/19716/13413.

MLA Handbook (7^{th} Edition):

Ralston, Michael. “Topics in computability, complexity, constructivity & provability: Topics in computability, complexity, constructivity and provability.” 2014. Web. 01 Dec 2020.

Vancouver:

Ralston M. Topics in computability, complexity, constructivity & provability: Topics in computability, complexity, constructivity and provability. [Internet] [Doctoral dissertation]. University of Delaware; 2014. [cited 2020 Dec 01]. Available from: http://udspace.udel.edu/handle/19716/13413.

Council of Science Editors:

Ralston M. Topics in computability, complexity, constructivity & provability: Topics in computability, complexity, constructivity and provability. [Doctoral Dissertation]. University of Delaware; 2014. Available from: http://udspace.udel.edu/handle/19716/13413

4.
Rubiano, Thomas.
Implicit *Computational* *Complexity* and Compilers : Complexité Implicite et compilateurs.

Degree: Docteur es, Informatique, 2017, Sorbonne Paris Cité

URL: http://www.theses.fr/2017USPCD076

►

*Complexity* theory helps us predict and control resources, usually time and space, consumed by programs. Static analysis on specific syntactic criterion allows us to categorize…
(more)

Subjects/Keywords: Complexité implicite; Implicit computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rubiano, T. (2017). Implicit Computational Complexity and Compilers : Complexité Implicite et compilateurs. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2017USPCD076

Chicago Manual of Style (16^{th} Edition):

Rubiano, Thomas. “Implicit Computational Complexity and Compilers : Complexité Implicite et compilateurs.” 2017. Doctoral Dissertation, Sorbonne Paris Cité. Accessed December 01, 2020. http://www.theses.fr/2017USPCD076.

MLA Handbook (7^{th} Edition):

Rubiano, Thomas. “Implicit Computational Complexity and Compilers : Complexité Implicite et compilateurs.” 2017. Web. 01 Dec 2020.

Vancouver:

Rubiano T. Implicit Computational Complexity and Compilers : Complexité Implicite et compilateurs. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2017. [cited 2020 Dec 01]. Available from: http://www.theses.fr/2017USPCD076.

Council of Science Editors:

Rubiano T. Implicit Computational Complexity and Compilers : Complexité Implicite et compilateurs. [Doctoral Dissertation]. Sorbonne Paris Cité; 2017. Available from: http://www.theses.fr/2017USPCD076

5. Telfar, Alexander. Absraction for Efficient Reinforcement Learning.

Degree: 2020, Victoria U of Wellington : Theses

URL: http://hdl.handle.net/10063/8990

► Successful reinforcement learning requires large amounts of data, compute, and some luck. We explore the ability of abstraction(s) to reduce these dependencies. Abstractions for reinforcement…
(more)

Subjects/Keywords: reinforcement learning; abstraction; computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Telfar, A. (2020). Absraction for Efficient Reinforcement Learning. (Masters Thesis). Victoria U of Wellington : Theses. Retrieved from http://hdl.handle.net/10063/8990

Chicago Manual of Style (16^{th} Edition):

Telfar, Alexander. “Absraction for Efficient Reinforcement Learning.” 2020. Masters Thesis, Victoria U of Wellington : Theses. Accessed December 01, 2020. http://hdl.handle.net/10063/8990.

MLA Handbook (7^{th} Edition):

Telfar, Alexander. “Absraction for Efficient Reinforcement Learning.” 2020. Web. 01 Dec 2020.

Vancouver:

Telfar A. Absraction for Efficient Reinforcement Learning. [Internet] [Masters thesis]. Victoria U of Wellington : Theses; 2020. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10063/8990.

Council of Science Editors:

Telfar A. Absraction for Efficient Reinforcement Learning. [Masters Thesis]. Victoria U of Wellington : Theses; 2020. Available from: http://hdl.handle.net/10063/8990

Ryerson University

6.
Monfared, Sareh Shafiei.
* Complexity* Analysis in Maintenance Systems.

Degree: 2010, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A1592

► *Complexity* is a very broad *subject* that applies to project management, engineering design and manufacturing, arithmetic, software, statistics, etc. In maintenance systems, *complexity* can be…
(more)

Subjects/Keywords: Technological complexity; Complexity (Philosophy); Computational complexity; System analysis; Reliability (Engineering)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Monfared, S. S. (2010). Complexity Analysis in Maintenance Systems. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1592

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Monfared, Sareh Shafiei. “Complexity Analysis in Maintenance Systems.” 2010. Thesis, Ryerson University. Accessed December 01, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A1592.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Monfared, Sareh Shafiei. “Complexity Analysis in Maintenance Systems.” 2010. Web. 01 Dec 2020.

Vancouver:

Monfared SS. Complexity Analysis in Maintenance Systems. [Internet] [Thesis]. Ryerson University; 2010. [cited 2020 Dec 01]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1592.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Monfared SS. Complexity Analysis in Maintenance Systems. [Thesis]. Ryerson University; 2010. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1592

Not specified: Masters Thesis or Doctoral Dissertation

Ryerson University

7. Pokhrel, Hari Prasad. Modelling Negative Correlation in Complex Networks Via Anti-Transitivity.

Degree: 2017, Ryerson University

URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A6911

► Negative correlation appears often in complex networks. For example, in social networks, negative correlation corresponds to rivalry between agents in the network, while in stock…
(more)

Subjects/Keywords: Algorithms; System analysis – Mathematics; Computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pokhrel, H. P. (2017). Modelling Negative Correlation in Complex Networks Via Anti-Transitivity. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A6911

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Pokhrel, Hari Prasad. “Modelling Negative Correlation in Complex Networks Via Anti-Transitivity.” 2017. Thesis, Ryerson University. Accessed December 01, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A6911.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Pokhrel, Hari Prasad. “Modelling Negative Correlation in Complex Networks Via Anti-Transitivity.” 2017. Web. 01 Dec 2020.

Vancouver:

Pokhrel HP. Modelling Negative Correlation in Complex Networks Via Anti-Transitivity. [Internet] [Thesis]. Ryerson University; 2017. [cited 2020 Dec 01]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6911.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pokhrel HP. Modelling Negative Correlation in Complex Networks Via Anti-Transitivity. [Thesis]. Ryerson University; 2017. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6911

Not specified: Masters Thesis or Doctoral Dissertation

University of Rochester

8. Menton, Curtis (1986 - ). Attacking and defending popular election systems.

Degree: PhD, 2013, University of Rochester

URL: http://hdl.handle.net/1802/27218

► The thesis of this dissertation is that *complexity* and algorithms, used appropriately, are important factors in assessing the value and uses of election systems. The…
(more)

Subjects/Keywords: Algorithms; Complexity; Computational social choice; Voting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Menton, C. (. -. ). (2013). Attacking and defending popular election systems. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/27218

Chicago Manual of Style (16^{th} Edition):

Menton, Curtis (1986 - ). “Attacking and defending popular election systems.” 2013. Doctoral Dissertation, University of Rochester. Accessed December 01, 2020. http://hdl.handle.net/1802/27218.

MLA Handbook (7^{th} Edition):

Menton, Curtis (1986 - ). “Attacking and defending popular election systems.” 2013. Web. 01 Dec 2020.

Vancouver:

Menton C(-). Attacking and defending popular election systems. [Internet] [Doctoral dissertation]. University of Rochester; 2013. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1802/27218.

Council of Science Editors:

Menton C(-). Attacking and defending popular election systems. [Doctoral Dissertation]. University of Rochester; 2013. Available from: http://hdl.handle.net/1802/27218

University of Michigan

9.
Tao, Biaoshuai.
* Complexity*, Algorithms, and Heuristics of Influence Maximization.

Degree: PhD, Computer Science & Engineering, 2020, University of Michigan

URL: http://hdl.handle.net/2027.42/155221

► People often adopt improved behaviors, products, or ideas through the influence of friends. This is modeled by emph{cascades}. One way to spread such positive elements…
(more)

Subjects/Keywords: influence maximization; computational complexity; Computer Science; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tao, B. (2020). Complexity, Algorithms, and Heuristics of Influence Maximization. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/155221

Chicago Manual of Style (16^{th} Edition):

Tao, Biaoshuai. “Complexity, Algorithms, and Heuristics of Influence Maximization.” 2020. Doctoral Dissertation, University of Michigan. Accessed December 01, 2020. http://hdl.handle.net/2027.42/155221.

MLA Handbook (7^{th} Edition):

Tao, Biaoshuai. “Complexity, Algorithms, and Heuristics of Influence Maximization.” 2020. Web. 01 Dec 2020.

Vancouver:

Tao B. Complexity, Algorithms, and Heuristics of Influence Maximization. [Internet] [Doctoral dissertation]. University of Michigan; 2020. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/2027.42/155221.

Council of Science Editors:

Tao B. Complexity, Algorithms, and Heuristics of Influence Maximization. [Doctoral Dissertation]. University of Michigan; 2020. Available from: http://hdl.handle.net/2027.42/155221

University of Manchester

10. Fenner, Peter John. Some algorithmic problems in monoids of Boolean matrices.

Degree: 2018, University of Manchester

URL: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995

► A Boolean matrix is a matrix with elements from the Boolean semiring ({0, 1}, +, x), where the addition and multiplication are as usual with…
(more)

Subjects/Keywords: semigroup theory; computational complexity; Boolean matrices

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fenner, P. J. (2018). Some algorithmic problems in monoids of Boolean matrices. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995

Chicago Manual of Style (16^{th} Edition):

Fenner, Peter John. “Some algorithmic problems in monoids of Boolean matrices.” 2018. Doctoral Dissertation, University of Manchester. Accessed December 01, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995.

MLA Handbook (7^{th} Edition):

Fenner, Peter John. “Some algorithmic problems in monoids of Boolean matrices.” 2018. Web. 01 Dec 2020.

Vancouver:

Fenner PJ. Some algorithmic problems in monoids of Boolean matrices. [Internet] [Doctoral dissertation]. University of Manchester; 2018. [cited 2020 Dec 01]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995.

Council of Science Editors:

Fenner PJ. Some algorithmic problems in monoids of Boolean matrices. [Doctoral Dissertation]. University of Manchester; 2018. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995

University of Illinois – Chicago

11.
Kun, Jeremy J.
Graphs, New Models, and * Complexity*.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/20977

► Over the past few decades the internet and social networks became central to our society. As a consequence, the study of networks and the algorithmic…
(more)

Subjects/Keywords: computational complexity; graphs; resilience; theoretical computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kun, J. J. (2016). Graphs, New Models, and Complexity. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20977

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kun, Jeremy J. “Graphs, New Models, and Complexity.” 2016. Thesis, University of Illinois – Chicago. Accessed December 01, 2020. http://hdl.handle.net/10027/20977.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kun, Jeremy J. “Graphs, New Models, and Complexity.” 2016. Web. 01 Dec 2020.

Vancouver:

Kun JJ. Graphs, New Models, and Complexity. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10027/20977.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kun JJ. Graphs, New Models, and Complexity. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20977

Not specified: Masters Thesis or Doctoral Dissertation

Brigham Young University

12. Ricks, Brian C. Graph-based Global Illumination.

Degree: MS, 2010, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd

► The slow render times of global illumination algorithms make them impractical in most commercial and academic settings. We propose a novel framework for calculating the…
(more)

Subjects/Keywords: global illumination; computational complexity; Computer Sciences

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ricks, B. C. (2010). Graph-based Global Illumination. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd

Chicago Manual of Style (16^{th} Edition):

Ricks, Brian C. “Graph-based Global Illumination.” 2010. Masters Thesis, Brigham Young University. Accessed December 01, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd.

MLA Handbook (7^{th} Edition):

Ricks, Brian C. “Graph-based Global Illumination.” 2010. Web. 01 Dec 2020.

Vancouver:

Ricks BC. Graph-based Global Illumination. [Internet] [Masters thesis]. Brigham Young University; 2010. [cited 2020 Dec 01]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd.

Council of Science Editors:

Ricks BC. Graph-based Global Illumination. [Masters Thesis]. Brigham Young University; 2010. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3422&context=etd

Hong Kong University of Science and Technology

13.
Wang, Qi.
The linear *complexity* of sequences with desirable correlation.

Degree: 2011, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7322 ; https://doi.org/10.14711/thesis-b1155167 ; http://repository.ust.hk/ir/bitstream/1783.1-7322/1/th_redirect.html

► Pseudo random sequences have many applications in code division multiple access (CDMA) communication systems, global positioning systems (GPS), stream ciphers, etc. In applications, since sequences…
(more)

Subjects/Keywords: Computational complexity ; Sequences (Mathematics) ; Random variables

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Q. (2011). The linear complexity of sequences with desirable correlation. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7322 ; https://doi.org/10.14711/thesis-b1155167 ; http://repository.ust.hk/ir/bitstream/1783.1-7322/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wang, Qi. “The linear complexity of sequences with desirable correlation.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed December 01, 2020. http://repository.ust.hk/ir/Record/1783.1-7322 ; https://doi.org/10.14711/thesis-b1155167 ; http://repository.ust.hk/ir/bitstream/1783.1-7322/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Qi. “The linear complexity of sequences with desirable correlation.” 2011. Web. 01 Dec 2020.

Vancouver:

Wang Q. The linear complexity of sequences with desirable correlation. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2020 Dec 01]. Available from: http://repository.ust.hk/ir/Record/1783.1-7322 ; https://doi.org/10.14711/thesis-b1155167 ; http://repository.ust.hk/ir/bitstream/1783.1-7322/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang Q. The linear complexity of sequences with desirable correlation. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7322 ; https://doi.org/10.14711/thesis-b1155167 ; http://repository.ust.hk/ir/bitstream/1783.1-7322/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

14.
Carruthers, Sarah.
The Role of the Goal in Problem Solving Hard *Computational* Problems: Do People Really Optimize?.

Degree: Interdisciplinary Graduate Program, 2015, University of Victoria

URL: http://hdl.handle.net/1828/6666

► Understanding how humans cope with *complexity* is perhaps one of the most important targets of scientific research. Humans not only excel at solving complex tasks…
(more)

Subjects/Keywords: Human Problem Solving; Computational Complexity; Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Carruthers, S. (2015). The Role of the Goal in Problem Solving Hard Computational Problems: Do People Really Optimize?. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/6666

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Carruthers, Sarah. “The Role of the Goal in Problem Solving Hard Computational Problems: Do People Really Optimize?.” 2015. Thesis, University of Victoria. Accessed December 01, 2020. http://hdl.handle.net/1828/6666.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Carruthers, Sarah. “The Role of the Goal in Problem Solving Hard Computational Problems: Do People Really Optimize?.” 2015. Web. 01 Dec 2020.

Vancouver:

Carruthers S. The Role of the Goal in Problem Solving Hard Computational Problems: Do People Really Optimize?. [Internet] [Thesis]. University of Victoria; 2015. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1828/6666.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Carruthers S. The Role of the Goal in Problem Solving Hard Computational Problems: Do People Really Optimize?. [Thesis]. University of Victoria; 2015. Available from: http://hdl.handle.net/1828/6666

Not specified: Masters Thesis or Doctoral Dissertation

California State University – Sacramento

15. Meyer, Andrew George. Canonical forms, over-coloring, and polytime graph isomorphism.

Degree: MS, Computer Science, 2019, California State University – Sacramento

URL: http://hdl.handle.net/10211.3/213411

► The question of Graph Isomorphism's (GI) true time *complexity* classification has remained a mystery for years. It is certainly in NP but uncertain whether or…
(more)

Subjects/Keywords: Symmetric groups; Graph matching; Computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Meyer, A. G. (2019). Canonical forms, over-coloring, and polytime graph isomorphism. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/213411

Chicago Manual of Style (16^{th} Edition):

Meyer, Andrew George. “Canonical forms, over-coloring, and polytime graph isomorphism.” 2019. Masters Thesis, California State University – Sacramento. Accessed December 01, 2020. http://hdl.handle.net/10211.3/213411.

MLA Handbook (7^{th} Edition):

Meyer, Andrew George. “Canonical forms, over-coloring, and polytime graph isomorphism.” 2019. Web. 01 Dec 2020.

Vancouver:

Meyer AG. Canonical forms, over-coloring, and polytime graph isomorphism. [Internet] [Masters thesis]. California State University – Sacramento; 2019. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10211.3/213411.

Council of Science Editors:

Meyer AG. Canonical forms, over-coloring, and polytime graph isomorphism. [Masters Thesis]. California State University – Sacramento; 2019. Available from: http://hdl.handle.net/10211.3/213411

Montana State University

16. Sturlaugson, Liessman Eric. Extensions to modeling and inference in continuous time Bayesian networks.

Degree: PhD, College of Engineering, 2014, Montana State University

URL: https://scholarworks.montana.edu/xmlui/handle/1/9368

► The continuous time Bayesian network (CTBN) enables reasoning about complex systems in continuous time by representing a system as a factored, finite-state, continuous-time Markov process.…
(more)

Subjects/Keywords: Markov processes.; Computational complexity.; Graphical modeling (Statistics).

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sturlaugson, L. E. (2014). Extensions to modeling and inference in continuous time Bayesian networks. (Doctoral Dissertation). Montana State University. Retrieved from https://scholarworks.montana.edu/xmlui/handle/1/9368

Chicago Manual of Style (16^{th} Edition):

Sturlaugson, Liessman Eric. “Extensions to modeling and inference in continuous time Bayesian networks.” 2014. Doctoral Dissertation, Montana State University. Accessed December 01, 2020. https://scholarworks.montana.edu/xmlui/handle/1/9368.

MLA Handbook (7^{th} Edition):

Sturlaugson, Liessman Eric. “Extensions to modeling and inference in continuous time Bayesian networks.” 2014. Web. 01 Dec 2020.

Vancouver:

Sturlaugson LE. Extensions to modeling and inference in continuous time Bayesian networks. [Internet] [Doctoral dissertation]. Montana State University; 2014. [cited 2020 Dec 01]. Available from: https://scholarworks.montana.edu/xmlui/handle/1/9368.

Council of Science Editors:

Sturlaugson LE. Extensions to modeling and inference in continuous time Bayesian networks. [Doctoral Dissertation]. Montana State University; 2014. Available from: https://scholarworks.montana.edu/xmlui/handle/1/9368

Massey University

17.
Anwar, Muhammad Nafees.
* Complexity* measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012
.

Degree: 2012, Massey University

URL: http://hdl.handle.net/10179/4287

► The class imbalance problem is a challenge in the statistical, machine learn- ing and data mining domains. Examples include fraud/intrusion detection, medical diagnosis/monitoring, bioinformatics, text…
(more)

Subjects/Keywords: Computational complexity; Class imbalance; Classification; Sampling; Statistics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Anwar, M. N. (2012). Complexity measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012 . (Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/4287

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Anwar, Muhammad Nafees. “Complexity measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012 .” 2012. Thesis, Massey University. Accessed December 01, 2020. http://hdl.handle.net/10179/4287.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Anwar, Muhammad Nafees. “Complexity measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012 .” 2012. Web. 01 Dec 2020.

Vancouver:

Anwar MN. Complexity measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012 . [Internet] [Thesis]. Massey University; 2012. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10179/4287.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Anwar MN. Complexity measurement for dealing with class imbalance problems in classification modelling : a thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy, Massey University, 2012 . [Thesis]. Massey University; 2012. Available from: http://hdl.handle.net/10179/4287

Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

18.
Trifonov, Vladimir Traianov.
Techniques for analyzing the *computational* power of constant-depth circuits and space-bounded computation.

Degree: PhD, Computer Sciences, 2006, University of Texas – Austin

URL: http://hdl.handle.net/2152/2975

► The *subject* of *computational* *complexity* theory is to analyze the difficulty of solving *computational* problems within different models of computation. Proving lower bounds is easier…
(more)

Subjects/Keywords: Computational complexity; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Trifonov, V. T. (2006). Techniques for analyzing the computational power of constant-depth circuits and space-bounded computation. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/2975

Chicago Manual of Style (16^{th} Edition):

Trifonov, Vladimir Traianov. “Techniques for analyzing the computational power of constant-depth circuits and space-bounded computation.” 2006. Doctoral Dissertation, University of Texas – Austin. Accessed December 01, 2020. http://hdl.handle.net/2152/2975.

MLA Handbook (7^{th} Edition):

Trifonov, Vladimir Traianov. “Techniques for analyzing the computational power of constant-depth circuits and space-bounded computation.” 2006. Web. 01 Dec 2020.

Vancouver:

Trifonov VT. Techniques for analyzing the computational power of constant-depth circuits and space-bounded computation. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2006. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/2152/2975.

Council of Science Editors:

Trifonov VT. Techniques for analyzing the computational power of constant-depth circuits and space-bounded computation. [Doctoral Dissertation]. University of Texas – Austin; 2006. Available from: http://hdl.handle.net/2152/2975

Tampere University

19.
Virtema, Jonni.
Approaches to Finite Variable Dependence: Expressiveness and *Computational* * Complexity*
.

Degree: 2014, Tampere University

URL: https://trepo.tuni.fi/handle/10024/95328

► Riippuvuuslogiikka on uusi formalismi, jossa tarkastellaan riippuvuuskäsitteeseen liittyviä ilmiöitä muodollisen logiikan viitekehyksessä. Muodollisiin logiikoihin liittyvissä matemaattisissa tarkasteluissa tutkimuksen kohteena on tyypillisesti logiikoiden ilmaisuvoima ja päättelyn…
(more)

Subjects/Keywords: logic ; mathematics ; dependence ; expressiveness ; computational complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Virtema, J. (2014). Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity . (Doctoral Dissertation). Tampere University. Retrieved from https://trepo.tuni.fi/handle/10024/95328

Chicago Manual of Style (16^{th} Edition):

Virtema, Jonni. “Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity .” 2014. Doctoral Dissertation, Tampere University. Accessed December 01, 2020. https://trepo.tuni.fi/handle/10024/95328.

MLA Handbook (7^{th} Edition):

Virtema, Jonni. “Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity .” 2014. Web. 01 Dec 2020.

Vancouver:

Virtema J. Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity . [Internet] [Doctoral dissertation]. Tampere University; 2014. [cited 2020 Dec 01]. Available from: https://trepo.tuni.fi/handle/10024/95328.

Council of Science Editors:

Virtema J. Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity . [Doctoral Dissertation]. Tampere University; 2014. Available from: https://trepo.tuni.fi/handle/10024/95328

Boston University

20. Finkelstein, Jeffrey. Parallelism with limited nondeterminism.

Degree: PhD, Computer Science, 2017, Boston University

URL: http://hdl.handle.net/2144/20720

► *Computational* *complexity* theory studies which *computational* problems can be solved with limited access to resources. The past fifty years have seen a focus on the…
(more)

Subjects/Keywords: Computer science; Computational complexity; Limited nondeterminism; Nondeterminism; Parallelism; Parameterized complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Finkelstein, J. (2017). Parallelism with limited nondeterminism. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/20720

Chicago Manual of Style (16^{th} Edition):

Finkelstein, Jeffrey. “Parallelism with limited nondeterminism.” 2017. Doctoral Dissertation, Boston University. Accessed December 01, 2020. http://hdl.handle.net/2144/20720.

MLA Handbook (7^{th} Edition):

Finkelstein, Jeffrey. “Parallelism with limited nondeterminism.” 2017. Web. 01 Dec 2020.

Vancouver:

Finkelstein J. Parallelism with limited nondeterminism. [Internet] [Doctoral dissertation]. Boston University; 2017. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/2144/20720.

Council of Science Editors:

Finkelstein J. Parallelism with limited nondeterminism. [Doctoral Dissertation]. Boston University; 2017. Available from: http://hdl.handle.net/2144/20720

University of Toronto

21.
Perron, Steven.
Power of Non-uniformity in Proof * Complexity*.

Degree: 2009, University of Toronto

URL: http://hdl.handle.net/1807/17477

►

As the title indicates, this thesis is concerned with the strength of non-uniformity in proof *complexity*. The non-uniform part is there because we look at…
(more)

Subjects/Keywords: proof complexity; computational complexity; 0984

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Perron, S. (2009). Power of Non-uniformity in Proof Complexity. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/17477

Chicago Manual of Style (16^{th} Edition):

Perron, Steven. “Power of Non-uniformity in Proof Complexity.” 2009. Doctoral Dissertation, University of Toronto. Accessed December 01, 2020. http://hdl.handle.net/1807/17477.

MLA Handbook (7^{th} Edition):

Perron, Steven. “Power of Non-uniformity in Proof Complexity.” 2009. Web. 01 Dec 2020.

Vancouver:

Perron S. Power of Non-uniformity in Proof Complexity. [Internet] [Doctoral dissertation]. University of Toronto; 2009. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1807/17477.

Council of Science Editors:

Perron S. Power of Non-uniformity in Proof Complexity. [Doctoral Dissertation]. University of Toronto; 2009. Available from: http://hdl.handle.net/1807/17477

University of Arkansas

22.
Apon, Daniel Christopher.
On the *Complexity* of Grid Coloring.

Degree: MS, 2011, University of Arkansas

URL: https://scholarworks.uark.edu/etd/108

► This thesis studies problems at the intersection of Ramsey-theoretic mathematics, *computational* *complexity*, and communication *complexity*. The prototypical example of such a problem is Monochromatic-Rectangle-Free…
(more)

Subjects/Keywords: Communication complexity; Computational complexity; High-performance computing; Ramsey theory; Computer Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Apon, D. C. (2011). On the Complexity of Grid Coloring. (Masters Thesis). University of Arkansas. Retrieved from https://scholarworks.uark.edu/etd/108

Chicago Manual of Style (16^{th} Edition):

Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Masters Thesis, University of Arkansas. Accessed December 01, 2020. https://scholarworks.uark.edu/etd/108.

MLA Handbook (7^{th} Edition):

Apon, Daniel Christopher. “On the Complexity of Grid Coloring.” 2011. Web. 01 Dec 2020.

Vancouver:

Apon DC. On the Complexity of Grid Coloring. [Internet] [Masters thesis]. University of Arkansas; 2011. [cited 2020 Dec 01]. Available from: https://scholarworks.uark.edu/etd/108.

Council of Science Editors:

Apon DC. On the Complexity of Grid Coloring. [Masters Thesis]. University of Arkansas; 2011. Available from: https://scholarworks.uark.edu/etd/108

23.
Wareham, Harold.
Systematic parameterized *complexity* analysis in *computational* phonology.

Degree: Department of Computer Science, 2017, University of Victoria

URL: https://dspace.library.uvic.ca//handle/1828/8806

► Many *computational* problems are NP-hard and hence probably do not have fast, i.e., polynomial time, algorithms. Such problems may yet have non-polynomial time algorithms, and…
(more)

Subjects/Keywords: Computational complexity; Computational linguistics

…*Complexity* Analysis of the L o n g e s t COMMON
SUBSEQUENCE
2.2
Problem… …4.1
The Parajneterized *Complexity* of the S S G -E n c o d e P r o b le m… …4.2
The Param eterized *Complexity* of the SSG-ENCODE Problem (C ont’d) . . .
4.3… …The Param eterized *Complexity* of the S S G -D e c o d e P r o b le m .................
4.4… …The Param eterized *Complexity* of the SSG-DECODE Problem (Gont’d)
4.5
75
126
127…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wareham, H. (2017). Systematic parameterized complexity analysis in computational phonology. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/8806

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wareham, Harold. “Systematic parameterized complexity analysis in computational phonology.” 2017. Thesis, University of Victoria. Accessed December 01, 2020. https://dspace.library.uvic.ca//handle/1828/8806.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wareham, Harold. “Systematic parameterized complexity analysis in computational phonology.” 2017. Web. 01 Dec 2020.

Vancouver:

Wareham H. Systematic parameterized complexity analysis in computational phonology. [Internet] [Thesis]. University of Victoria; 2017. [cited 2020 Dec 01]. Available from: https://dspace.library.uvic.ca//handle/1828/8806.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wareham H. Systematic parameterized complexity analysis in computational phonology. [Thesis]. University of Victoria; 2017. Available from: https://dspace.library.uvic.ca//handle/1828/8806

Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

24. Magkakis, Andreas Gkompel. Counting, modular counting and graph homomorphisms.

Degree: PhD, 2016, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929

► A homomorphism from a graph G to a graph H is a function from V (G) to V (H) that preserves edges. Many combinatorial structures…
(more)

Subjects/Keywords: 511; Computer science; evolutionary dynamics; graph homomorphisms; computational complexity; computational counting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Magkakis, A. G. (2016). Counting, modular counting and graph homomorphisms. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929

Chicago Manual of Style (16^{th} Edition):

Magkakis, Andreas Gkompel. “Counting, modular counting and graph homomorphisms.” 2016. Doctoral Dissertation, University of Oxford. Accessed December 01, 2020. http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929.

MLA Handbook (7^{th} Edition):

Magkakis, Andreas Gkompel. “Counting, modular counting and graph homomorphisms.” 2016. Web. 01 Dec 2020.

Vancouver:

Magkakis AG. Counting, modular counting and graph homomorphisms. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2020 Dec 01]. Available from: http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929.

Council of Science Editors:

Magkakis AG. Counting, modular counting and graph homomorphisms. [Doctoral Dissertation]. University of Oxford; 2016. Available from: http://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.729929

Duke University

25.
Xia, Lirong.
* Computational* Voting Theory: Game-Theoretic and Combinatorial Aspects
.

Degree: 2011, Duke University

URL: http://hdl.handle.net/10161/5694

► For at least two thousand years, voting has been used as one of the most effective ways to aggregate people's ordinal preferences. In the…
(more)

Subjects/Keywords: Computer Science; combinatorial voting; computational complexity; computational voting theory; manipulation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xia, L. (2011). Computational Voting Theory: Game-Theoretic and Combinatorial Aspects . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/5694

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Xia, Lirong. “Computational Voting Theory: Game-Theoretic and Combinatorial Aspects .” 2011. Thesis, Duke University. Accessed December 01, 2020. http://hdl.handle.net/10161/5694.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xia, Lirong. “Computational Voting Theory: Game-Theoretic and Combinatorial Aspects .” 2011. Web. 01 Dec 2020.

Vancouver:

Xia L. Computational Voting Theory: Game-Theoretic and Combinatorial Aspects . [Internet] [Thesis]. Duke University; 2011. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10161/5694.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xia L. Computational Voting Theory: Game-Theoretic and Combinatorial Aspects . [Thesis]. Duke University; 2011. Available from: http://hdl.handle.net/10161/5694

Not specified: Masters Thesis or Doctoral Dissertation

Universidade do Rio Grande do Sul

26.
Silva, Mateus Grellert da.
* Computational* effort analysis and control in High Efficiency Video Coding.

Degree: 2014, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/95943

►

Codificadores HEVC impõem diversos desafios em aplicações embarcadas com restrições computacionais, especialmente quando há restrições de processamento em tempo real. Para tornar a codificação de… (more)

Subjects/Keywords: Video coding; Microeletrônica; HEVC; Codificacao : Video digital; Complexity control; Computational effort analysis; Complexity assessment

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Silva, M. G. d. (2014). Computational effort analysis and control in High Efficiency Video Coding. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/95943

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Silva, Mateus Grellert da. “Computational effort analysis and control in High Efficiency Video Coding.” 2014. Thesis, Universidade do Rio Grande do Sul. Accessed December 01, 2020. http://hdl.handle.net/10183/95943.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Silva, Mateus Grellert da. “Computational effort analysis and control in High Efficiency Video Coding.” 2014. Web. 01 Dec 2020.

Vancouver:

Silva MGd. Computational effort analysis and control in High Efficiency Video Coding. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2014. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/10183/95943.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva MGd. Computational effort analysis and control in High Efficiency Video Coding. [Thesis]. Universidade do Rio Grande do Sul; 2014. Available from: http://hdl.handle.net/10183/95943

Not specified: Masters Thesis or Doctoral Dissertation

UCLA

27. Rosenbaum, William Bailey. Distributed Almost Stable Matchings.

Degree: Mathematics, 2016, UCLA

URL: http://www.escholarship.org/uc/item/6pr8d66m

► The Stable Marriage Problem (SMP) is concerned with the follow scenario: suppose we have two disjoint sets of agents—for example prospective students and colleges, medical…
(more)

Subjects/Keywords: Mathematics; Computer science; Economics; communication complexity; computational complexity; distributed algorithms; stable marriage problem; stable matchings

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rosenbaum, W. B. (2016). Distributed Almost Stable Matchings. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/6pr8d66m

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Rosenbaum, William Bailey. “Distributed Almost Stable Matchings.” 2016. Thesis, UCLA. Accessed December 01, 2020. http://www.escholarship.org/uc/item/6pr8d66m.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Rosenbaum, William Bailey. “Distributed Almost Stable Matchings.” 2016. Web. 01 Dec 2020.

Vancouver:

Rosenbaum WB. Distributed Almost Stable Matchings. [Internet] [Thesis]. UCLA; 2016. [cited 2020 Dec 01]. Available from: http://www.escholarship.org/uc/item/6pr8d66m.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rosenbaum WB. Distributed Almost Stable Matchings. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/6pr8d66m

Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

28.
Ghasemloo, Kaveh.
Uniformity and Nonuniformity in Proof * Complexity*.

Degree: PhD, 2016, University of Toronto

URL: http://hdl.handle.net/1807/76425

► This thesis is dedicated to the study of the relations between uniform and nonuniform proof *complexity* and *computational* *complexity*. Nonuniform proof *complexity* studies the lengths…
(more)

Subjects/Keywords: AltTime; Bounded Arithmetic; Computational Complexity; NC1; Proof Complexity; Subexponential-size Bounded-depth Frege; 0984

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghasemloo, K. (2016). Uniformity and Nonuniformity in Proof Complexity. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/76425

Chicago Manual of Style (16^{th} Edition):

Ghasemloo, Kaveh. “Uniformity and Nonuniformity in Proof Complexity.” 2016. Doctoral Dissertation, University of Toronto. Accessed December 01, 2020. http://hdl.handle.net/1807/76425.

MLA Handbook (7^{th} Edition):

Ghasemloo, Kaveh. “Uniformity and Nonuniformity in Proof Complexity.” 2016. Web. 01 Dec 2020.

Vancouver:

Ghasemloo K. Uniformity and Nonuniformity in Proof Complexity. [Internet] [Doctoral dissertation]. University of Toronto; 2016. [cited 2020 Dec 01]. Available from: http://hdl.handle.net/1807/76425.

Council of Science Editors:

Ghasemloo K. Uniformity and Nonuniformity in Proof Complexity. [Doctoral Dissertation]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/76425

University of Lund

29. Teleman, Johan. Quantitative analysis of mass spectrometry proteomics data : Software for improved life science.

Degree: 2016, University of Lund

URL: https://lup.lub.lu.se/record/0b76cce2-be76-4599-81c7-b5fd4e1860c2 ; https://portal.research.lu.se/ws/files/7557261/thesis_final.pdf

► The rapid advances in life science, including the sequencing of the human genome and numerous other techiques, has given an extraordinary ability to aquire data…
(more)

Subjects/Keywords: Bioinformatics (Computational Biology); computational proteomics; bioinformatics; life science; data complexity; algorithms; mass spectrometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Teleman, J. (2016). Quantitative analysis of mass spectrometry proteomics data : Software for improved life science. (Doctoral Dissertation). University of Lund. Retrieved from https://lup.lub.lu.se/record/0b76cce2-be76-4599-81c7-b5fd4e1860c2 ; https://portal.research.lu.se/ws/files/7557261/thesis_final.pdf

Chicago Manual of Style (16^{th} Edition):

Teleman, Johan. “Quantitative analysis of mass spectrometry proteomics data : Software for improved life science.” 2016. Doctoral Dissertation, University of Lund. Accessed December 01, 2020. https://lup.lub.lu.se/record/0b76cce2-be76-4599-81c7-b5fd4e1860c2 ; https://portal.research.lu.se/ws/files/7557261/thesis_final.pdf.

MLA Handbook (7^{th} Edition):

Teleman, Johan. “Quantitative analysis of mass spectrometry proteomics data : Software for improved life science.” 2016. Web. 01 Dec 2020.

Vancouver:

Teleman J. Quantitative analysis of mass spectrometry proteomics data : Software for improved life science. [Internet] [Doctoral dissertation]. University of Lund; 2016. [cited 2020 Dec 01]. Available from: https://lup.lub.lu.se/record/0b76cce2-be76-4599-81c7-b5fd4e1860c2 ; https://portal.research.lu.se/ws/files/7557261/thesis_final.pdf.

Council of Science Editors:

Teleman J. Quantitative analysis of mass spectrometry proteomics data : Software for improved life science. [Doctoral Dissertation]. University of Lund; 2016. Available from: https://lup.lub.lu.se/record/0b76cce2-be76-4599-81c7-b5fd4e1860c2 ; https://portal.research.lu.se/ws/files/7557261/thesis_final.pdf

University of Oxford

30. Hadida, Jonathan. Simulating brain resting-state activity : what matters?.

Degree: PhD, 2018, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:5abd962a-b798-4530-947a-24eeafd568f3 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780414

► In the field of *computational* neuroscience, large-scale biophysical modelling is a bottom-up approach to study the interaction between brain structure and function. In this thesis,…
(more)

Subjects/Keywords: Structure-function; Computational neuroscience; Computational modelling; Biophysical modelling; Complexity science; Bayesian optimisation; Neuroscience

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hadida, J. (2018). Simulating brain resting-state activity : what matters?. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:5abd962a-b798-4530-947a-24eeafd568f3 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780414

Chicago Manual of Style (16^{th} Edition):

Hadida, Jonathan. “Simulating brain resting-state activity : what matters?.” 2018. Doctoral Dissertation, University of Oxford. Accessed December 01, 2020. http://ora.ox.ac.uk/objects/uuid:5abd962a-b798-4530-947a-24eeafd568f3 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780414.

MLA Handbook (7^{th} Edition):

Hadida, Jonathan. “Simulating brain resting-state activity : what matters?.” 2018. Web. 01 Dec 2020.

Vancouver:

Hadida J. Simulating brain resting-state activity : what matters?. [Internet] [Doctoral dissertation]. University of Oxford; 2018. [cited 2020 Dec 01]. Available from: http://ora.ox.ac.uk/objects/uuid:5abd962a-b798-4530-947a-24eeafd568f3 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780414.

Council of Science Editors:

Hadida J. Simulating brain resting-state activity : what matters?. [Doctoral Dissertation]. University of Oxford; 2018. Available from: http://ora.ox.ac.uk/objects/uuid:5abd962a-b798-4530-947a-24eeafd568f3 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780414