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 – Urbana-Champaign" +contributor:("Hajek, Bruce"). Showing records 1 – 30 of 50 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Zhou, Zeyu. Per-flow cardinality estimation based on virtual LogLog sketching.

Degree: MS, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 Flow cardinality estimation is the problem of estimating the number of distinct elements in a data flow, often with a stringent memory constraint. It has… (more)

Subjects/Keywords: Network traffic measurement; Per-flow cardinality estimation; Maximum-likelihood estimator; Virtual LogLog sketch

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, Z. (2016). Per-flow cardinality estimation based on virtual LogLog sketching. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95257

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

Zhou, Zeyu. “Per-flow cardinality estimation based on virtual LogLog sketching.” 2016. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/95257.

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

MLA Handbook (7th Edition):

Zhou, Zeyu. “Per-flow cardinality estimation based on virtual LogLog sketching.” 2016. Web. 16 Apr 2021.

Vancouver:

Zhou Z. Per-flow cardinality estimation based on virtual LogLog sketching. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/95257.

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

Council of Science Editors:

Zhou Z. Per-flow cardinality estimation based on virtual LogLog sketching. [Thesis]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95257

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


University of Illinois – Urbana-Champaign

2. Xu, Jiaming. Statistical inference in networks: fundamental limits and efficient algorithms.

Degree: PhD, 1200, 2015, University of Illinois – Urbana-Champaign

 Today witnesses an explosion of data coming from various types of networks such as online social networks and biological networks. The goal of this thesis… (more)

Subjects/Keywords: Community detection; Networks; Statistical inference

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, J. (2015). Statistical inference in networks: fundamental limits and efficient algorithms. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/72799

Chicago Manual of Style (16th Edition):

Xu, Jiaming. “Statistical inference in networks: fundamental limits and efficient algorithms.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/72799.

MLA Handbook (7th Edition):

Xu, Jiaming. “Statistical inference in networks: fundamental limits and efficient algorithms.” 2015. Web. 16 Apr 2021.

Vancouver:

Xu J. Statistical inference in networks: fundamental limits and efficient algorithms. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/72799.

Council of Science Editors:

Xu J. Statistical inference in networks: fundamental limits and efficient algorithms. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/72799


University of Illinois – Urbana-Champaign

3. Yang, James Yifei. Distributed content collection and rank aggregation.

Degree: PhD, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 Despite the substantial literature on recommendation systems, there have been few studies in distributed settings, where peers provide recommendations locally. Motivated by word of mouth… (more)

Subjects/Keywords: Rank Aggregation; Score Aggregation; Mean Field; Scaling; Recommendation System; Peer-to-Peer; Content Collection; Independent Crossover Model; Plackett-Luce; Zipf; Independent Crossover Model; Clustering; Multi-Cluster; Multi-Cluster; Hypothesis Testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, J. Y. (2016). Distributed content collection and rank aggregation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95281

Chicago Manual of Style (16th Edition):

Yang, James Yifei. “Distributed content collection and rank aggregation.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/95281.

MLA Handbook (7th Edition):

Yang, James Yifei. “Distributed content collection and rank aggregation.” 2016. Web. 16 Apr 2021.

Vancouver:

Yang JY. Distributed content collection and rank aggregation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/95281.

Council of Science Editors:

Yang JY. Distributed content collection and rank aggregation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95281


University of Illinois – Urbana-Champaign

4. Yekkehkhany, Ali. Risk-averse multi-armed bandits and game theory.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 The multi-armed bandit (MAB) and game theory literature is mainly focused on the expected cumulative reward and the expected payoffs in a game, respectively. In… (more)

Subjects/Keywords: Online Learning; Multi-Armed Bandits; Exploration-Exploitation; Explore-Then-Commit Bandits; Risk-Aversion; Game Theory; Stochastic Game Theory; Congestion Games; Affinity Scheduling; MapReduce; Data Center

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yekkehkhany, A. (2020). Risk-averse multi-armed bandits and game theory. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/108439

Chicago Manual of Style (16th Edition):

Yekkehkhany, Ali. “Risk-averse multi-armed bandits and game theory.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/108439.

MLA Handbook (7th Edition):

Yekkehkhany, Ali. “Risk-averse multi-armed bandits and game theory.” 2020. Web. 16 Apr 2021.

Vancouver:

Yekkehkhany A. Risk-averse multi-armed bandits and game theory. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/108439.

Council of Science Editors:

Yekkehkhany A. Risk-averse multi-armed bandits and game theory. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/108439


University of Illinois – Urbana-Champaign

5. Chen, Wei. Value function approximation architectures for neuro-dynamic programming.

Degree: PhD, 1200, 2014, University of Illinois – Urbana-Champaign

 Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations. In their most computationally attractive formulations, these techniques provide… (more)

Subjects/Keywords: Neuro-Dynamic Programming; Parametric Q-learning; Value Function Approximation; Processor Power Management; Data Center Power Management; Cross-Layer Wireless Control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, W. (2014). Value function approximation architectures for neuro-dynamic programming. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46909

Chicago Manual of Style (16th Edition):

Chen, Wei. “Value function approximation architectures for neuro-dynamic programming.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/46909.

MLA Handbook (7th Edition):

Chen, Wei. “Value function approximation architectures for neuro-dynamic programming.” 2014. Web. 16 Apr 2021.

Vancouver:

Chen W. Value function approximation architectures for neuro-dynamic programming. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/46909.

Council of Science Editors:

Chen W. Value function approximation architectures for neuro-dynamic programming. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46909


University of Illinois – Urbana-Champaign

6. Tan, Bo. Optimization in stochastic models of network applications.

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

 In this dissertation, we propose stochastic models and develop optimal or near-optimal algorithms for resource allocation, for two important network applications: 1) video-on-demand (VoD) services… (more)

Subjects/Keywords: Content Distribution Networks; Online Advertising; Stochastic Models; Optimization; Resource Allocation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tan, B. (2012). Optimization in stochastic models of network applications. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/34431

Chicago Manual of Style (16th Edition):

Tan, Bo. “Optimization in stochastic models of network applications.” 2012. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/34431.

MLA Handbook (7th Edition):

Tan, Bo. “Optimization in stochastic models of network applications.” 2012. Web. 16 Apr 2021.

Vancouver:

Tan B. Optimization in stochastic models of network applications. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2012. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/34431.

Council of Science Editors:

Tan B. Optimization in stochastic models of network applications. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2012. Available from: http://hdl.handle.net/2142/34431


University of Illinois – Urbana-Champaign

7. Yu, Ge. Dynamic online resource allocation problems.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 Online resource allocation problems consider assigning a limited number of available resources to sequentially arriving requests with the objective to maximize rewards. With the emergence… (more)

Subjects/Keywords: Online assignment; resource allocation problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, G. (2018). Dynamic online resource allocation problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100930

Chicago Manual of Style (16th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/100930.

MLA Handbook (7th Edition):

Yu, Ge. “Dynamic online resource allocation problems.” 2018. Web. 16 Apr 2021.

Vancouver:

Yu G. Dynamic online resource allocation problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/100930.

Council of Science Editors:

Yu G. Dynamic online resource allocation problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100930


University of Illinois – Urbana-Champaign

8. Khetan, Ashish Kumar. Social computation: Fundamental limits and efficient algorithms.

Degree: PhD, Industrial Engineering, 2018, University of Illinois – Urbana-Champaign

 Social computing systems bring enormous value to society by harnessing the data generated by the members of a community. Though each individual reveals a little… (more)

Subjects/Keywords: Ranking; Crowdsourcing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khetan, A. K. (2018). Social computation: Fundamental limits and efficient algorithms. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/100996

Chicago Manual of Style (16th Edition):

Khetan, Ashish Kumar. “Social computation: Fundamental limits and efficient algorithms.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/100996.

MLA Handbook (7th Edition):

Khetan, Ashish Kumar. “Social computation: Fundamental limits and efficient algorithms.” 2018. Web. 16 Apr 2021.

Vancouver:

Khetan AK. Social computation: Fundamental limits and efficient algorithms. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/100996.

Council of Science Editors:

Khetan AK. Social computation: Fundamental limits and efficient algorithms. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/100996


University of Illinois – Urbana-Champaign

9. Moon, Jun. Control and estimation with limited information: a game-theoretic approach.

Degree: PhD, Electrical & Computer Engineering, 2015, University of Illinois – Urbana-Champaign

 Modern control systems can be viewed as interconnections of spatially distributed multiple subsystems, where the individual subsystems share their information with each other through an… (more)

Subjects/Keywords: Game Theory; Limited Information

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moon, J. (2015). Control and estimation with limited information: a game-theoretic approach. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88941

Chicago Manual of Style (16th Edition):

Moon, Jun. “Control and estimation with limited information: a game-theoretic approach.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/88941.

MLA Handbook (7th Edition):

Moon, Jun. “Control and estimation with limited information: a game-theoretic approach.” 2015. Web. 16 Apr 2021.

Vancouver:

Moon J. Control and estimation with limited information: a game-theoretic approach. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/88941.

Council of Science Editors:

Moon J. Control and estimation with limited information: a game-theoretic approach. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88941


University of Illinois – Urbana-Champaign

10. Kairouz, Peter. The fundamental limits of statistical data privacy.

Degree: PhD, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 The Internet is shaping our daily lives. On the one hand, social networks like Facebook and Twitter allow people to share their precious moments and… (more)

Subjects/Keywords: Privacy; Information Theory; Data Privacy; Statistics; Multi-Party Computation; Security; Local Differential Privacy; Privacy-Preserving Machine Learning Algorithms; Information Theoretic Utilities; f-Divergence; Mutual Information; Statistical Inference; Hypothesis Testing; Estimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kairouz, P. (2016). The fundamental limits of statistical data privacy. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/92686

Chicago Manual of Style (16th Edition):

Kairouz, Peter. “The fundamental limits of statistical data privacy.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/92686.

MLA Handbook (7th Edition):

Kairouz, Peter. “The fundamental limits of statistical data privacy.” 2016. Web. 16 Apr 2021.

Vancouver:

Kairouz P. The fundamental limits of statistical data privacy. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/92686.

Council of Science Editors:

Kairouz P. The fundamental limits of statistical data privacy. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/92686

11. Bojja Venkatakrishnan, Shaileshh. Algorithms for interactive, distributed and networked systems.

Degree: PhD, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

 In recent years, massive growth in internet usage has spurred the emergence of complex large-scale networking systems to serve growing user bases, bandwidth and computation… (more)

Subjects/Keywords: Network algorithms; Interactive communication; Communication complexity; Protocol compression; Scheduling; Circuit switch; Data center networks; Submodularity; Peer-to-peer; Streaming; Topology; Bitcoin; Anonymity; Distributed algorithms; Cryptocurrency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bojja Venkatakrishnan, S. (2017). Algorithms for interactive, distributed and networked systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98367

Chicago Manual of Style (16th Edition):

Bojja Venkatakrishnan, Shaileshh. “Algorithms for interactive, distributed and networked systems.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/98367.

MLA Handbook (7th Edition):

Bojja Venkatakrishnan, Shaileshh. “Algorithms for interactive, distributed and networked systems.” 2017. Web. 16 Apr 2021.

Vancouver:

Bojja Venkatakrishnan S. Algorithms for interactive, distributed and networked systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/98367.

Council of Science Editors:

Bojja Venkatakrishnan S. Algorithms for interactive, distributed and networked systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98367


University of Illinois – Urbana-Champaign

12. Yang, Pengkun. Polynomial methods in statistical inference: Theory and practice.

Degree: PhD, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 Recent advances in genetics, computer vision, and text mining are accompanied by analyzing data coming from a large domain, where the domain size is comparable… (more)

Subjects/Keywords: polynomial methods; statistical inference; minimax estimation; polynomial approximation; method of moments; efficient algorithm; fundamental limits

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, P. (2018). Polynomial methods in statistical inference: Theory and practice. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102774

Chicago Manual of Style (16th Edition):

Yang, Pengkun. “Polynomial methods in statistical inference: Theory and practice.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/102774.

MLA Handbook (7th Edition):

Yang, Pengkun. “Polynomial methods in statistical inference: Theory and practice.” 2018. Web. 16 Apr 2021.

Vancouver:

Yang P. Polynomial methods in statistical inference: Theory and practice. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/102774.

Council of Science Editors:

Yang P. Polynomial methods in statistical inference: Theory and practice. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102774


University of Illinois – Urbana-Champaign

13. Gupta, Harsh. Sample-efficient reinforcement learning.

Degree: PhD, Electrical & Computer Engr, 2020, University of Illinois – Urbana-Champaign

 Reinforcement learning has been instrumental in the recent advances made by artificial intelligence agents in various domains. Most of these advances have been abetted by… (more)

Subjects/Keywords: reinforcement learning; sample-efficient learning; bandits; q-learning; td-learning; stochastic approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, H. (2020). Sample-efficient reinforcement learning. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/109429

Chicago Manual of Style (16th Edition):

Gupta, Harsh. “Sample-efficient reinforcement learning.” 2020. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/109429.

MLA Handbook (7th Edition):

Gupta, Harsh. “Sample-efficient reinforcement learning.” 2020. Web. 16 Apr 2021.

Vancouver:

Gupta H. Sample-efficient reinforcement learning. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2020. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/109429.

Council of Science Editors:

Gupta H. Sample-efficient reinforcement learning. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2020. Available from: http://hdl.handle.net/2142/109429

14. Sankagiri, Suryanarayana. Community detection in preferential attachment graphs.

Degree: MS, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 This thesis examines the problem of community detection in a new random graph model, which is a generalization of preferential attachment graphs. This model has… (more)

Subjects/Keywords: community detection; preferential attachment graphs; message passing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sankagiri, S. (2018). Community detection in preferential attachment graphs. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102474

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

Sankagiri, Suryanarayana. “Community detection in preferential attachment graphs.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/102474.

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

MLA Handbook (7th Edition):

Sankagiri, Suryanarayana. “Community detection in preferential attachment graphs.” 2018. Web. 16 Apr 2021.

Vancouver:

Sankagiri S. Community detection in preferential attachment graphs. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/102474.

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

Council of Science Editors:

Sankagiri S. Community detection in preferential attachment graphs. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102474

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

15. Livesay, Michael R. Analysis of non-unique solutions in mean field games.

Degree: MS, Electrical & Computer Engr, 2018, University of Illinois – Urbana-Champaign

 This thesis investigates cases when solutions to a mean field game (MFG) are non-unique. The symmetric Markov perfect information N-player game is considered and restricted… (more)

Subjects/Keywords: Mean field games; initial-terminal value problem; non-uniqueness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Livesay, M. R. (2018). Analysis of non-unique solutions in mean field games. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101031

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

Livesay, Michael R. “Analysis of non-unique solutions in mean field games.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/101031.

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

MLA Handbook (7th Edition):

Livesay, Michael R. “Analysis of non-unique solutions in mean field games.” 2018. Web. 16 Apr 2021.

Vancouver:

Livesay MR. Analysis of non-unique solutions in mean field games. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/101031.

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

Council of Science Editors:

Livesay MR. Analysis of non-unique solutions in mean field games. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101031

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

16. Spuckler, Charles M. A martingale-based trust system.

Degree: MS, 1200, 2010, University of Illinois – Urbana-Champaign

 The primary objective in this project is to formulate and examine a martingale-based trust framework. The goal is to develop strategies for probing the links… (more)

Subjects/Keywords: trust model

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Spuckler, C. M. (2010). A martingale-based trust system. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16504

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

Spuckler, Charles M. “A martingale-based trust system.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/16504.

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

MLA Handbook (7th Edition):

Spuckler, Charles M. “A martingale-based trust system.” 2010. Web. 16 Apr 2021.

Vancouver:

Spuckler CM. A martingale-based trust system. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/16504.

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

Council of Science Editors:

Spuckler CM. A martingale-based trust system. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16504

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

17. Yang, James. Single video performance analysis for video-on-demand systems.

Degree: MS, 1200, 2013, University of Illinois – Urbana-Champaign

 We study the content placement problem for cache delivery video-on-demand systems under static random network topologies with fixed heavy-tailed video demand. The performance measure is… (more)

Subjects/Keywords: Cache delivery; Video-on-demand (VoD); Peer-to-peer (P2P); random network topology; Content placement; Adaptive placement; Fractional storage; Integer relaxation; Hybrid placement; Single video analysis; Multiple video analysis; Decoupled systems; Primal-dual algorithm; General algorithm; Maximum distance separable (MDS) codes

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, J. (2013). Single video performance analysis for video-on-demand systems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44239

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

Chicago Manual of Style (16th Edition):

Yang, James. “Single video performance analysis for video-on-demand systems.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/44239.

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

MLA Handbook (7th Edition):

Yang, James. “Single video performance analysis for video-on-demand systems.” 2013. Web. 16 Apr 2021.

Vancouver:

Yang J. Single video performance analysis for video-on-demand systems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/44239.

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

Council of Science Editors:

Yang J. Single video performance analysis for video-on-demand systems. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44239

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

18. AlHamad, Osama A. Analyzing performance of SIC with multiple power multichannel Aloha.

Degree: MS, 1200, 2011, University of Illinois – Urbana-Champaign

 This thesis analyzes the performance of successive interference cancellation (SIC) when used with multiple power, multichannel Aloha. We use the fluid model to analyze the… (more)

Subjects/Keywords: multichannel Aloha; successive interference cancellation (SIC); Large Delay; Satellite

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

AlHamad, O. A. (2011). Analyzing performance of SIC with multiple power multichannel Aloha. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18222

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

AlHamad, Osama A. “Analyzing performance of SIC with multiple power multichannel Aloha.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/18222.

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

MLA Handbook (7th Edition):

AlHamad, Osama A. “Analyzing performance of SIC with multiple power multichannel Aloha.” 2011. Web. 16 Apr 2021.

Vancouver:

AlHamad OA. Analyzing performance of SIC with multiple power multichannel Aloha. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/18222.

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

Council of Science Editors:

AlHamad OA. Analyzing performance of SIC with multiple power multichannel Aloha. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18222

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

19. Maguluri, Siva Theja. Optimal scheduling algorithms for ad hoc wireless networks.

Degree: MS, 1200, 2011, University of Illinois – Urbana-Champaign

 It is well known that the MaxWeight scheduling algorithm is throughput-optimal in wireless networks. However, its complexity is exponential in the number of links in… (more)

Subjects/Keywords: Adhoc Networks; Scheduling; Wireless; Lyapunov; optimal

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

Maguluri, S. T. (2011). Optimal scheduling algorithms for ad hoc wireless networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/24097

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

Maguluri, Siva Theja. “Optimal scheduling algorithms for ad hoc wireless networks.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/24097.

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

MLA Handbook (7th Edition):

Maguluri, Siva Theja. “Optimal scheduling algorithms for ad hoc wireless networks.” 2011. Web. 16 Apr 2021.

Vancouver:

Maguluri ST. Optimal scheduling algorithms for ad hoc wireless networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/24097.

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

Council of Science Editors:

Maguluri ST. Optimal scheduling algorithms for ad hoc wireless networks. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/24097

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

20. Roth, Ronald. RFID anti-collision technique: coherent collision.

Degree: MS, 0115, 2013, University of Illinois – Urbana-Champaign

 RFID technology has enabled great advances in the asset tracking industry. Shipping, warehouse inventory, and storefront security are just a few examples where the application… (more)

Subjects/Keywords: Radio frequency identification (RFID); Anti-Collision; Coherent Collision; ALOHA; Dynamic Framed Slotted ALOHA (DFSA) variant; Collision; Load Modulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roth, R. (2013). RFID anti-collision technique: coherent collision. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/44163

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

Roth, Ronald. “RFID anti-collision technique: coherent collision.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/44163.

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

MLA Handbook (7th Edition):

Roth, Ronald. “RFID anti-collision technique: coherent collision.” 2013. Web. 16 Apr 2021.

Vancouver:

Roth R. RFID anti-collision technique: coherent collision. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/44163.

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

Council of Science Editors:

Roth R. RFID anti-collision technique: coherent collision. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/44163

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

21. Abhishek, Vineet. Revenue considerations in market design.

Degree: PhD, 1200, 2013, University of Illinois – Urbana-Champaign

 This thesis is about the design and analysis of smart markets for selling commodities and resources. Examples include combinatorial auctions, markets for selling resources, and… (more)

Subjects/Keywords: Smart market design; combinatorial auctions; revenue and welfare; pricing cloud services; profit sharing contracts; bidding with securities

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

Abhishek, V. (2013). Revenue considerations in market design. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42205

Chicago Manual of Style (16th Edition):

Abhishek, Vineet. “Revenue considerations in market design.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/42205.

MLA Handbook (7th Edition):

Abhishek, Vineet. “Revenue considerations in market design.” 2013. Web. 16 Apr 2021.

Vancouver:

Abhishek V. Revenue considerations in market design. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/42205.

Council of Science Editors:

Abhishek V. Revenue considerations in market design. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42205

22. Zhu, Ji. Stability and performance in peer to peer networks.

Degree: PhD, 1200, 2014, University of Illinois – Urbana-Champaign

 Stability regions of P2P systems describe analytically the scalability and robustness of the systems; they reveal intrinsic properties of P2P systems and provide intuition and… (more)

Subjects/Keywords: Peer to peer (P2P); Stability Region; Scalability; Robustness; BitTorrent; file sharing; video on demand; live streaming; Foster Lyapunov stability criterion; network coding; seed dwelling; missing piece syndrome; one club; bundling swarms; multi swarm; stochastic model; queuing network; Markov chain; sojourn time; video broadcast; broadcast tree; tree management; distributed streaming algorithm; sub stream; multicast trees; butt servers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, J. (2014). Stability and performance in peer to peer networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46753

Chicago Manual of Style (16th Edition):

Zhu, Ji. “Stability and performance in peer to peer networks.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/46753.

MLA Handbook (7th Edition):

Zhu, Ji. “Stability and performance in peer to peer networks.” 2014. Web. 16 Apr 2021.

Vancouver:

Zhu J. Stability and performance in peer to peer networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/46753.

Council of Science Editors:

Zhu J. Stability and performance in peer to peer networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46753


University of Illinois – Urbana-Champaign

23. Aghasadeghi, Navid. Joint throughput and delay optimization in multihop networks.

Degree: MS, 1200, 2010, University of Illinois – Urbana-Champaign

 As the use of the Internet evolves, more and more applications require quality of service constraints such as end-to-end delay requirements, in addition to throughput… (more)

Subjects/Keywords: quality of service; QoS; Rate and Delay control; Markov Approximation; end-to-end delay

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aghasadeghi, N. (2010). Joint throughput and delay optimization in multihop networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16141

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

Aghasadeghi, Navid. “Joint throughput and delay optimization in multihop networks.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/16141.

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

MLA Handbook (7th Edition):

Aghasadeghi, Navid. “Joint throughput and delay optimization in multihop networks.” 2010. Web. 16 Apr 2021.

Vancouver:

Aghasadeghi N. Joint throughput and delay optimization in multihop networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/16141.

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

Council of Science Editors:

Aghasadeghi N. Joint throughput and delay optimization in multihop networks. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16141

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


University of Illinois – Urbana-Champaign

24. Zhu, Ji. Analysis of P2P file transferring system by stochastic queue models.

Degree: MS, 1200, 2010, University of Illinois – Urbana-Champaign

 Distributed protocols for peer-to-peer (P2P) file sharing over the Internet have been highly successful in recent years. The idea is that files to be shared… (more)

Subjects/Keywords: Peer-to-peer (P2P); Queue model; File transferring; one club; stability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, J. (2010). Analysis of P2P file transferring system by stochastic queue models. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/16485

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

Zhu, Ji. “Analysis of P2P file transferring system by stochastic queue models.” 2010. Thesis, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/16485.

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

MLA Handbook (7th Edition):

Zhu, Ji. “Analysis of P2P file transferring system by stochastic queue models.” 2010. Web. 16 Apr 2021.

Vancouver:

Zhu J. Analysis of P2P file transferring system by stochastic queue models. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2010. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/16485.

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

Council of Science Editors:

Zhu J. Analysis of P2P file transferring system by stochastic queue models. [Thesis]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/16485

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

25. Taghvaei, Amirhossein. Design and analysis of particle-based algorithms for nonlinear filtering and sampling.

Degree: PhD, Mechanical Engineering, 2019, University of Illinois – Urbana-Champaign

 This thesis is concerned with the design and analysis of particle-based algorithms for two problems: (i) the nonlinear filtering problem; (ii) and the problem of… (more)

Subjects/Keywords: Nonlinear filtering; Monte-Carlo methods; Mean-field optimal control; Optimal transportation

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

Taghvaei, A. (2019). Design and analysis of particle-based algorithms for nonlinear filtering and sampling. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/105673

Chicago Manual of Style (16th Edition):

Taghvaei, Amirhossein. “Design and analysis of particle-based algorithms for nonlinear filtering and sampling.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/105673.

MLA Handbook (7th Edition):

Taghvaei, Amirhossein. “Design and analysis of particle-based algorithms for nonlinear filtering and sampling.” 2019. Web. 16 Apr 2021.

Vancouver:

Taghvaei A. Design and analysis of particle-based algorithms for nonlinear filtering and sampling. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/105673.

Council of Science Editors:

Taghvaei A. Design and analysis of particle-based algorithms for nonlinear filtering and sampling. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/105673

26. Wu, Rui. Learning network structure from node behavior.

Degree: PhD, 1200, 2015, University of Illinois – Urbana-Champaign

 Understanding the network structure connecting a group of entities is of interest in applications such as predicting stock prices and making recommendations to customers. The… (more)

Subjects/Keywords: Markov random field; structure learning; recommender systems; clustering; convex optimization; ranking; Bradley-Terry model; projection; maximum likelihood estimation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, R. (2015). Learning network structure from node behavior. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/72830

Chicago Manual of Style (16th Edition):

Wu, Rui. “Learning network structure from node behavior.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/72830.

MLA Handbook (7th Edition):

Wu, Rui. “Learning network structure from node behavior.” 2015. Web. 16 Apr 2021.

Vancouver:

Wu R. Learning network structure from node behavior. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/72830.

Council of Science Editors:

Wu R. Learning network structure from node behavior. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/72830

27. Geng, Quan. The optimal mechanism in differential privacy.

Degree: PhD, 1200, 2014, University of Illinois – Urbana-Champaign

 Differential privacy is a framework to quantify to what extent individual privacy in a statistical database is preserved while releasing useful aggregate information about the… (more)

Subjects/Keywords: Differential Privacy; Laplacian Mechanism; Staircase Mechanism; Privacy and Utility

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Geng, Q. (2014). The optimal mechanism in differential privacy. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46705

Chicago Manual of Style (16th Edition):

Geng, Quan. “The optimal mechanism in differential privacy.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/46705.

MLA Handbook (7th Edition):

Geng, Quan. “The optimal mechanism in differential privacy.” 2014. Web. 16 Apr 2021.

Vancouver:

Geng Q. The optimal mechanism in differential privacy. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/46705.

Council of Science Editors:

Geng Q. The optimal mechanism in differential privacy. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46705

28. Kadloor, Sachin. Scheduling with privacy constraints.

Degree: PhD, 1200, 2014, University of Illinois – Urbana-Champaign

 Traditionally, scheduling policies have been optimized to perform well on metrics such as throughput, delay, and fairness. In the context of shared event schedulers, where… (more)

Subjects/Keywords: scheduling; privacy; timing channel; side channel

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kadloor, S. (2014). Scheduling with privacy constraints. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46692

Chicago Manual of Style (16th Edition):

Kadloor, Sachin. “Scheduling with privacy constraints.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/46692.

MLA Handbook (7th Edition):

Kadloor, Sachin. “Scheduling with privacy constraints.” 2014. Web. 16 Apr 2021.

Vancouver:

Kadloor S. Scheduling with privacy constraints. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/46692.

Council of Science Editors:

Kadloor S. Scheduling with privacy constraints. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46692

29. Xie, Qiaomin. Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails.

Degree: PhD, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

 Scheduling and resource allocation in cloud systems is of fundamental importance to system efficiency. The focus of this thesis is to study the fundamental limits… (more)

Subjects/Keywords: Scheduling; Resource Allocation; Cloud Computing; Data Locality; Virtual Machine Assignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, Q. (2016). Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95280

Chicago Manual of Style (16th Edition):

Xie, Qiaomin. “Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/95280.

MLA Handbook (7th Edition):

Xie, Qiaomin. “Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails.” 2016. Web. 16 Apr 2021.

Vancouver:

Xie Q. Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/95280.

Council of Science Editors:

Xie Q. Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95280

30. Sayin, Muhammed O. Belief shaping in noncooperative communication and control systems through strategic signaling.

Degree: PhD, Electrical & Computer Engr, 2019, University of Illinois – Urbana-Champaign

 In this dissertation, we analyze the interaction between intelligent and selfish agents in non-cooperative environments with a specific focus on the transmission of some private… (more)

Subjects/Keywords: Information Design; Belief Shaping; Game Theory; Signaling; Strategic Information Transmission; Deception

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sayin, M. O. (2019). Belief shaping in noncooperative communication and control systems through strategic signaling. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/106143

Chicago Manual of Style (16th Edition):

Sayin, Muhammed O. “Belief shaping in noncooperative communication and control systems through strategic signaling.” 2019. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 16, 2021. http://hdl.handle.net/2142/106143.

MLA Handbook (7th Edition):

Sayin, Muhammed O. “Belief shaping in noncooperative communication and control systems through strategic signaling.” 2019. Web. 16 Apr 2021.

Vancouver:

Sayin MO. Belief shaping in noncooperative communication and control systems through strategic signaling. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2019. [cited 2021 Apr 16]. Available from: http://hdl.handle.net/2142/106143.

Council of Science Editors:

Sayin MO. Belief shaping in noncooperative communication and control systems through strategic signaling. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2019. Available from: http://hdl.handle.net/2142/106143

[1] [2]

.