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 +publisher:"University of Illinois – Chicago" +contributor:("Reyzin, Lev"). Showing records 1 – 21 of 21 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Chicago

1. Fish, Benjamin. New Models and Algorithms for Data Analysis.

Degree: 2018, University of Illinois – Chicago

 In this thesis, we introduce and analyze new models and new algorithms for problems in data analysis. Many new challenges and constraints for data analysis… (more)

Subjects/Keywords: data analysis; machine learning; computational learning theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fish, B. (2018). New Models and Algorithms for Data Analysis. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22689

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

Fish, Benjamin. “New Models and Algorithms for Data Analysis.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22689.

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

MLA Handbook (7th Edition):

Fish, Benjamin. “New Models and Algorithms for Data Analysis.” 2018. Web. 18 Jan 2021.

Vancouver:

Fish B. New Models and Algorithms for Data Analysis. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22689.

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

Council of Science Editors:

Fish B. New Models and Algorithms for Data Analysis. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22689

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


University of Illinois – Chicago

2. Janardhanan, Mano Vikash. Algorithms for Learning Networks and Learning from Networks.

Degree: 2019, University of Illinois – Chicago

 There are many different networks we encounter in every day life. Social networks, internet (short form of interconnected network) and biological networks are some examples.… (more)

Subjects/Keywords: theoretical computer science; learning theory; complexity theory; graph theory; machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Janardhanan, M. V. (2019). Algorithms for Learning Networks and Learning from Networks. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23636

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

Janardhanan, Mano Vikash. “Algorithms for Learning Networks and Learning from Networks.” 2019. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/23636.

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

MLA Handbook (7th Edition):

Janardhanan, Mano Vikash. “Algorithms for Learning Networks and Learning from Networks.” 2019. Web. 18 Jan 2021.

Vancouver:

Janardhanan MV. Algorithms for Learning Networks and Learning from Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2019. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/23636.

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

Council of Science Editors:

Janardhanan MV. Algorithms for Learning Networks and Learning from Networks. [Thesis]. University of Illinois – Chicago; 2019. Available from: http://hdl.handle.net/10027/23636

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


University of Illinois – Chicago

3. Huang, Yi. Problems in Learning under Limited Resources and Information.

Degree: 2017, University of Illinois – Chicago

 The main theme of this thesis is to investigate how learning problems can be solved in the face of limited resources and with limited information… (more)

Subjects/Keywords: feature-efficient learning; network construction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, Y. (2017). Problems in Learning under Limited Resources and Information. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21988

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

Huang, Yi. “Problems in Learning under Limited Resources and Information.” 2017. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21988.

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

MLA Handbook (7th Edition):

Huang, Yi. “Problems in Learning under Limited Resources and Information.” 2017. Web. 18 Jan 2021.

Vancouver:

Huang Y. Problems in Learning under Limited Resources and Information. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21988.

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

Council of Science Editors:

Huang Y. Problems in Learning under Limited Resources and Information. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21988

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


University of Illinois – Chicago

4. Stading, RJ. Ramsey Type Results on Hypercubes and Hypergraphs.

Degree: 2015, University of Illinois – Chicago

 In this thesis, we will examine some Ramsey type problems for graphs and hypergraphs. Our starting point, and motivating question, is to determine the minimum… (more)

Subjects/Keywords: hypercube

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stading, R. (2015). Ramsey Type Results on Hypercubes and Hypergraphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/19392

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

Stading, RJ. “Ramsey Type Results on Hypercubes and Hypergraphs.” 2015. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/19392.

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

MLA Handbook (7th Edition):

Stading, RJ. “Ramsey Type Results on Hypercubes and Hypergraphs.” 2015. Web. 18 Jan 2021.

Vancouver:

Stading R. Ramsey Type Results on Hypercubes and Hypergraphs. [Internet] [Thesis]. University of Illinois – Chicago; 2015. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/19392.

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

Council of Science Editors:

Stading R. Ramsey Type Results on Hypercubes and Hypergraphs. [Thesis]. University of Illinois – Chicago; 2015. Available from: http://hdl.handle.net/10027/19392

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


University of Illinois – Chicago

5. Kun, Jeremy J. Graphs, New Models, and Complexity.

Degree: 2016, University of Illinois – Chicago

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

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

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

MLA Handbook (7th Edition):

Kun, Jeremy J. “Graphs, New Models, and Complexity.” 2016. Web. 18 Jan 2021.

Vancouver:

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

Note: this citation may be lacking information needed for this citation format:
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

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


University of Illinois – Chicago

6. Monfort, Mathew. Methods in Large Scale Inverse Optimal Control.

Degree: 2016, University of Illinois – Chicago

 As our technology continues to evolve, so does the complexity of the problems that we expect our systems to solve. The challenge is that these… (more)

Subjects/Keywords: machine learning; artificial intelligence; inverse optimal control; graph search; autonomous agents; reinforcement learning; path distributions; robotic control; robotics; robots; activity recognition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Monfort, M. (2016). Methods in Large Scale Inverse Optimal Control. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21540

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

Monfort, Mathew. “Methods in Large Scale Inverse Optimal Control.” 2016. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21540.

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

MLA Handbook (7th Edition):

Monfort, Mathew. “Methods in Large Scale Inverse Optimal Control.” 2016. Web. 18 Jan 2021.

Vancouver:

Monfort M. Methods in Large Scale Inverse Optimal Control. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21540.

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

Council of Science Editors:

Monfort M. Methods in Large Scale Inverse Optimal Control. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/21540

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


University of Illinois – Chicago

7. Lelkes, Ádám D. Algorithms and Complexity Results for Learning and Big Data.

Degree: 2017, University of Illinois – Chicago

 This thesis focuses on problems in the theory and practice of machine learning and big data. We will explore the complexity-theoretic properties of MapReduce, one… (more)

Subjects/Keywords: theoretical computer science; learning theory; machine learning; big data; complexity theory; mapreduce; clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lelkes, . D. (2017). Algorithms and Complexity Results for Learning and Big Data. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21729

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

Lelkes, Ádám D. “Algorithms and Complexity Results for Learning and Big Data.” 2017. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21729.

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

MLA Handbook (7th Edition):

Lelkes, Ádám D. “Algorithms and Complexity Results for Learning and Big Data.” 2017. Web. 18 Jan 2021.

Vancouver:

Lelkes D. Algorithms and Complexity Results for Learning and Big Data. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21729.

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

Council of Science Editors:

Lelkes D. Algorithms and Complexity Results for Learning and Big Data. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21729

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


University of Illinois – Chicago

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

Degree: 2017, University of Illinois – Chicago

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

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


University of Illinois – Chicago

9. Bliss, Nathan R. Computing Series Expansions of Algebraic Space Curves.

Degree: 2018, University of Illinois – Chicago

 We work towards a series-based computational approach for polynomial systems having positive-dimensional solution sets. The tropical variety gives information on the exponents of the leading… (more)

Subjects/Keywords: computational algebraic geometry; puiseux series; gauss-newton algorithm; tropical geometry; polynomial systems; homotopy continuation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bliss, N. R. (2018). Computing Series Expansions of Algebraic Space Curves. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22682

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

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22682.

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

MLA Handbook (7th Edition):

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Web. 18 Jan 2021.

Vancouver:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22682.

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

Council of Science Editors:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22682

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


University of Illinois – Chicago

10. Sommars, Jeffrey C. Algorithms and Implementations in Computational Algebraic Geometry.

Degree: 2018, University of Illinois – Chicago

 In this thesis, we explore several areas of computational algebraic geometry, and develop new algorithms and software in each. We are generally interested in solving… (more)

Subjects/Keywords: Tropical geometry; computational algebraic geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sommars, J. C. (2018). Algorithms and Implementations in Computational Algebraic Geometry. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22687

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

Sommars, Jeffrey C. “Algorithms and Implementations in Computational Algebraic Geometry.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22687.

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

MLA Handbook (7th Edition):

Sommars, Jeffrey C. “Algorithms and Implementations in Computational Algebraic Geometry.” 2018. Web. 18 Jan 2021.

Vancouver:

Sommars JC. Algorithms and Implementations in Computational Algebraic Geometry. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22687.

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

Council of Science Editors:

Sommars JC. Algorithms and Implementations in Computational Algebraic Geometry. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22687

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


University of Illinois – Chicago

11. Cole, Samuel. An Iterative Spectral Approach to Recovering Planted Partitions.

Degree: 2018, University of Illinois – Chicago

 In the planted partition problem, the n vertices of a random graph are partitioned into k "clusters," and edges between vertices in the same cluster… (more)

Subjects/Keywords: Planted partition; Clustering; Random graphs; Spectral algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cole, S. (2018). An Iterative Spectral Approach to Recovering Planted Partitions. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22704

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

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22704.

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

MLA Handbook (7th Edition):

Cole, Samuel. “An Iterative Spectral Approach to Recovering Planted Partitions.” 2018. Web. 18 Jan 2021.

Vancouver:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22704.

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

Council of Science Editors:

Cole S. An Iterative Spectral Approach to Recovering Planted Partitions. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22704

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


University of Illinois – Chicago

12. Sharabiani, Anooshiravan. Novel Approaches Towards Fast and Accurate Time series Classification.

Degree: 2018, University of Illinois – Chicago

 A time series is a collection of values made or recorded over time. Dynamic Time Warping (DTW) is an algorithm for measuring similarity between two… (more)

Subjects/Keywords: Time series; Dynamic Time Warping; Classification; Approximation Methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharabiani, A. (2018). Novel Approaches Towards Fast and Accurate Time series Classification. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22708

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

Sharabiani, Anooshiravan. “Novel Approaches Towards Fast and Accurate Time series Classification.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22708.

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

MLA Handbook (7th Edition):

Sharabiani, Anooshiravan. “Novel Approaches Towards Fast and Accurate Time series Classification.” 2018. Web. 18 Jan 2021.

Vancouver:

Sharabiani A. Novel Approaches Towards Fast and Accurate Time series Classification. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22708.

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

Council of Science Editors:

Sharabiani A. Novel Approaches Towards Fast and Accurate Time series Classification. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22708

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


University of Illinois – Chicago

13. Wang, Lujia. Problems in Extremal and Probabilistic Combinatorics.

Degree: 2018, University of Illinois – Chicago

 We study the following four problems in extremal and probabilistic combinatorics: 1. A sunflower is a collection of distinct sets such that the intersection of… (more)

Subjects/Keywords: Combinatorics; Extremal set theory; Probabilistic methods; Random set systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, L. (2018). Problems in Extremal and Probabilistic Combinatorics. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22982

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

Chicago Manual of Style (16th Edition):

Wang, Lujia. “Problems in Extremal and Probabilistic Combinatorics.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22982.

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

MLA Handbook (7th Edition):

Wang, Lujia. “Problems in Extremal and Probabilistic Combinatorics.” 2018. Web. 18 Jan 2021.

Vancouver:

Wang L. Problems in Extremal and Probabilistic Combinatorics. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22982.

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

Council of Science Editors:

Wang L. Problems in Extremal and Probabilistic Combinatorics. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22982

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


University of Illinois – Chicago

14. Liu, Anqi. Robust Prediction Methods for Covariate Shift and Active Learning.

Degree: 2018, University of Illinois – Chicago

 In real world machine learning applications, it is often not very realistic to assume that the training data distribution aligns with the testing data distribution.… (more)

Subjects/Keywords: Covariate Shift; Active Learning; Robust Learning; Classification; Kernel Methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, A. (2018). Robust Prediction Methods for Covariate Shift and Active Learning. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22988

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

Chicago Manual of Style (16th Edition):

Liu, Anqi. “Robust Prediction Methods for Covariate Shift and Active Learning.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/22988.

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

MLA Handbook (7th Edition):

Liu, Anqi. “Robust Prediction Methods for Covariate Shift and Active Learning.” 2018. Web. 18 Jan 2021.

Vancouver:

Liu A. Robust Prediction Methods for Covariate Shift and Active Learning. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/22988.

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

Council of Science Editors:

Liu A. Robust Prediction Methods for Covariate Shift and Active Learning. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22988

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


University of Illinois – Chicago

15. Diochnos, Dimitrios. Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases.

Degree: 2013, University of Illinois – Chicago

 This thesis is concerned with problems that arise in learning theory as well as with an investigation, using the tools of network analysis, of a… (more)

Subjects/Keywords: evolvability; multiple-instance learning; active learning; knowledge bases; network analysis; Boolean functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Diochnos, D. (2013). Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/10366

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

Diochnos, Dimitrios. “Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases.” 2013. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/10366.

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

MLA Handbook (7th Edition):

Diochnos, Dimitrios. “Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases.” 2013. Web. 18 Jan 2021.

Vancouver:

Diochnos D. Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases. [Internet] [Thesis]. University of Illinois – Chicago; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/10366.

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

Council of Science Editors:

Diochnos D. Analysis of Algorithms in Learning Theory and Network Analysis of Knowledge Bases. [Thesis]. University of Illinois – Chicago; 2013. Available from: http://hdl.handle.net/10027/10366

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


University of Illinois – Chicago

16. Cameron, Alexander M. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.

Degree: 2018, University of Illinois – Chicago

 Let a 2 to 1 directed hypergraph be a 3-uniform hypergraph where every edge has two tail vertices and one head vertex. For any such… (more)

Subjects/Keywords: combinatorics; graph theory; hypergraphs; extremal problems; directed hypergraphs; Ramsey's theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cameron, A. M. (2018). Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23148

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

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/23148.

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

MLA Handbook (7th Edition):

Cameron, Alexander M. “Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs.” 2018. Web. 18 Jan 2021.

Vancouver:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/23148.

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

Council of Science Editors:

Cameron AM. Extremal Problems on Directed Hypergraphs and the Erdös-Gyárfás Ramsey Problem Variant for Graphs. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/23148

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


University of Illinois – Chicago

17. Powers, Brian Reed. An Analysis of Multivariate Final-Offer Arbitration.

Degree: 2016, University of Illinois – Chicago

 When negotiations fail, arbitration is often an effective means by which a binding resolution can be found. To address the many shortcomings of conventional arbitration,… (more)

Subjects/Keywords: game theory; final offer arbitration; muti-dimensional; whole package; uncertainty; optimal strategies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Powers, B. R. (2016). An Analysis of Multivariate Final-Offer Arbitration. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21615

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

Powers, Brian Reed. “An Analysis of Multivariate Final-Offer Arbitration.” 2016. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/21615.

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

MLA Handbook (7th Edition):

Powers, Brian Reed. “An Analysis of Multivariate Final-Offer Arbitration.” 2016. Web. 18 Jan 2021.

Vancouver:

Powers BR. An Analysis of Multivariate Final-Offer Arbitration. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/21615.

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

Council of Science Editors:

Powers BR. An Analysis of Multivariate Final-Offer Arbitration. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/21615

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


University of Illinois – Chicago

18. Fathony, Rizal Zaini Ahmad. Performance-Aligned Learning Algorithms with Statistical Guarantees.

Degree: 2019, University of Illinois – Chicago

 The goal of many prediction tasks in machine learning is to learn a prediction function that minimizes certain loss metrics (e.g., zero-one, ordinal, and cost-sensitive… (more)

Subjects/Keywords: Machine Learning; Classification; Surrogate Loss; Structured Prediction; Graphical Models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fathony, R. Z. A. (2019). Performance-Aligned Learning Algorithms with Statistical Guarantees. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23627

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

Fathony, Rizal Zaini Ahmad. “Performance-Aligned Learning Algorithms with Statistical Guarantees.” 2019. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/23627.

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

MLA Handbook (7th Edition):

Fathony, Rizal Zaini Ahmad. “Performance-Aligned Learning Algorithms with Statistical Guarantees.” 2019. Web. 18 Jan 2021.

Vancouver:

Fathony RZA. Performance-Aligned Learning Algorithms with Statistical Guarantees. [Internet] [Thesis]. University of Illinois – Chicago; 2019. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/23627.

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

Council of Science Editors:

Fathony RZA. Performance-Aligned Learning Algorithms with Statistical Guarantees. [Thesis]. University of Illinois – Chicago; 2019. Available from: http://hdl.handle.net/10027/23627

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

19. Cooper, Jeffrey R. Independent Sets in Sparse Hypergraphs.

Degree: 2014, University of Illinois – Chicago

 We study the independence number and chromatic number of hypergraphs which contain no copies of a fixed subgraph. Let H be a 3-uniform hypergraph with… (more)

Subjects/Keywords: hypergraphs; independent sets; chromatic number

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

Cooper, J. R. (2014). Independent Sets in Sparse Hypergraphs. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/18782

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

Cooper, Jeffrey R. “Independent Sets in Sparse Hypergraphs.” 2014. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/18782.

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

MLA Handbook (7th Edition):

Cooper, Jeffrey R. “Independent Sets in Sparse Hypergraphs.” 2014. Web. 18 Jan 2021.

Vancouver:

Cooper JR. Independent Sets in Sparse Hypergraphs. [Internet] [Thesis]. University of Illinois – Chicago; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/18782.

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

Council of Science Editors:

Cooper JR. Independent Sets in Sparse Hypergraphs. [Thesis]. University of Illinois – Chicago; 2014. Available from: http://hdl.handle.net/10027/18782

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

20. Yu, Xiangcheng. Accelerating Polynomial Homotopy Continuation on Graphics Processing Units.

Degree: 2016, University of Illinois – Chicago

 Polynomial homotopy continuation is a symbolic-numerical method to compute all solutions of a polynomial system. In this thesis, an accelerated homotopy continuation method is designed… (more)

Subjects/Keywords: cloud computing; graphics processing unit(GPU); massive parallel algorithm; Newton's method; polynomial system; polynomial homotopy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, X. (2016). Accelerating Polynomial Homotopy Continuation on Graphics Processing Units. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20153

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

Yu, Xiangcheng. “Accelerating Polynomial Homotopy Continuation on Graphics Processing Units.” 2016. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/20153.

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

MLA Handbook (7th Edition):

Yu, Xiangcheng. “Accelerating Polynomial Homotopy Continuation on Graphics Processing Units.” 2016. Web. 18 Jan 2021.

Vancouver:

Yu X. Accelerating Polynomial Homotopy Continuation on Graphics Processing Units. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/20153.

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

Council of Science Editors:

Yu X. Accelerating Polynomial Homotopy Continuation on Graphics Processing Units. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20153

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

21. Habiba, Habiba. Critical Individuals in Dynamic Population Networks.

Degree: 2013, University of Illinois – Chicago

 Diffusion of contaminants, diseases, rumors, fads, and many other dynamic processes typically take place through a network of interacting entities. One fundamental question in the… (more)

Subjects/Keywords: Network theory; Graph mining; Social Network Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Habiba, H. (2013). Critical Individuals in Dynamic Population Networks. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/10140

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

Habiba, Habiba. “Critical Individuals in Dynamic Population Networks.” 2013. Thesis, University of Illinois – Chicago. Accessed January 18, 2021. http://hdl.handle.net/10027/10140.

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

MLA Handbook (7th Edition):

Habiba, Habiba. “Critical Individuals in Dynamic Population Networks.” 2013. Web. 18 Jan 2021.

Vancouver:

Habiba H. Critical Individuals in Dynamic Population Networks. [Internet] [Thesis]. University of Illinois – Chicago; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10027/10140.

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

Council of Science Editors:

Habiba H. Critical Individuals in Dynamic Population Networks. [Thesis]. University of Illinois – Chicago; 2013. Available from: http://hdl.handle.net/10027/10140

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

.