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:"Georgia Tech" +contributor:("Vempala, Santosh"). Showing records 1 – 30 of 32 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Georgia Tech

1. Durfee, David. Algorithmic Manipulation of Probability Distributions for Networks and Mechanisms.

Degree: PhD, Computer Science, 2018, Georgia Tech

 In this thesis we present four different works that solve problems in dynamic graph algorithms, spectral graph algorithms, computational economics, and differential privacy. While these… (more)

Subjects/Keywords: Algorithms; Sampling; Networks; Mechanisms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Durfee, D. (2018). Algorithmic Manipulation of Probability Distributions for Networks and Mechanisms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62623

Chicago Manual of Style (16th Edition):

Durfee, David. “Algorithmic Manipulation of Probability Distributions for Networks and Mechanisms.” 2018. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/62623.

MLA Handbook (7th Edition):

Durfee, David. “Algorithmic Manipulation of Probability Distributions for Networks and Mechanisms.” 2018. Web. 07 Jul 2020.

Vancouver:

Durfee D. Algorithmic Manipulation of Probability Distributions for Networks and Mechanisms. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/62623.

Council of Science Editors:

Durfee D. Algorithmic Manipulation of Probability Distributions for Networks and Mechanisms. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/62623


Georgia Tech

2. Petti, Samantha N. Randomness as a tool for modeling and uncovering structure.

Degree: PhD, Mathematics, 2020, Georgia Tech

 This thesis contains four main research directions, united by the themes of using randomness to (i) construct structure and (ii) uncover structure. Randomness has long… (more)

Subjects/Keywords: Random processes; Stochastic process; graph; hard sphere

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Petti, S. N. (2020). Randomness as a tool for modeling and uncovering structure. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62767

Chicago Manual of Style (16th Edition):

Petti, Samantha N. “Randomness as a tool for modeling and uncovering structure.” 2020. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/62767.

MLA Handbook (7th Edition):

Petti, Samantha N. “Randomness as a tool for modeling and uncovering structure.” 2020. Web. 07 Jul 2020.

Vancouver:

Petti SN. Randomness as a tool for modeling and uncovering structure. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/62767.

Council of Science Editors:

Petti SN. Randomness as a tool for modeling and uncovering structure. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/62767


Georgia Tech

3. Samadi, Samira. Human Aspects of Machine Learning.

Degree: PhD, Computer Science, 2020, Georgia Tech

 With the widespread use of Machine Learning (ML) algorithms in everyday life, it is important to study the human aspects of these algorithms. ML algorithms… (more)

Subjects/Keywords: Fairness; Usability; Security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Samadi, S. (2020). Human Aspects of Machine Learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/62775

Chicago Manual of Style (16th Edition):

Samadi, Samira. “Human Aspects of Machine Learning.” 2020. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/62775.

MLA Handbook (7th Edition):

Samadi, Samira. “Human Aspects of Machine Learning.” 2020. Web. 07 Jul 2020.

Vancouver:

Samadi S. Human Aspects of Machine Learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2020. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/62775.

Council of Science Editors:

Samadi S. Human Aspects of Machine Learning. [Doctoral Dissertation]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/62775


Georgia Tech

4. Luo, Chenchi. Non-uniform sampling: algorithms and architectures.

Degree: PhD, Electrical and Computer Engineering, 2012, Georgia Tech

 Modern signal processing applications emerging in telecommunication and instrumentation industries have placed an increasing demand for ADCs with higher speed and resolution. The most fundamental… (more)

Subjects/Keywords: TIADC; Farrow structure; Compressive sensing; Sparsity; Analog-to-digital converters; Sampling (Statistics); Algorithms; Signal processing; Signal processing Digital techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luo, C. (2012). Non-uniform sampling: algorithms and architectures. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/45873

Chicago Manual of Style (16th Edition):

Luo, Chenchi. “Non-uniform sampling: algorithms and architectures.” 2012. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/45873.

MLA Handbook (7th Edition):

Luo, Chenchi. “Non-uniform sampling: algorithms and architectures.” 2012. Web. 07 Jul 2020.

Vancouver:

Luo C. Non-uniform sampling: algorithms and architectures. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/45873.

Council of Science Editors:

Luo C. Non-uniform sampling: algorithms and architectures. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/45873


Georgia Tech

5. Galanis, Andreas. Phase transitions in the complexity of counting.

Degree: PhD, Computer Science, 2014, Georgia Tech

 A recent line of works established a remarkable connection for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of… (more)

Subjects/Keywords: Phase transitions; Partition function; Approximation algorithms; Spin systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Galanis, A. (2014). Phase transitions in the complexity of counting. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52211

Chicago Manual of Style (16th Edition):

Galanis, Andreas. “Phase transitions in the complexity of counting.” 2014. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/52211.

MLA Handbook (7th Edition):

Galanis, Andreas. “Phase transitions in the complexity of counting.” 2014. Web. 07 Jul 2020.

Vancouver:

Galanis A. Phase transitions in the complexity of counting. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/52211.

Council of Science Editors:

Galanis A. Phase transitions in the complexity of counting. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52211


Georgia Tech

6. Zhang, Peng. Hardness and tractability for structured numerical problems.

Degree: PhD, Computer Science, 2018, Georgia Tech

 We study structured linear systems and structured linear programs (LPs) from both algorithm and complexity perspectives. These structured problems commonly arise in combinatorial optimization, machine… (more)

Subjects/Keywords: Linear systems; Linear programs; Hardness; Algorithms; Generalized Laplacian matrices; Packing and covering LPs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, P. (2018). Hardness and tractability for structured numerical problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60735

Chicago Manual of Style (16th Edition):

Zhang, Peng. “Hardness and tractability for structured numerical problems.” 2018. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/60735.

MLA Handbook (7th Edition):

Zhang, Peng. “Hardness and tractability for structured numerical problems.” 2018. Web. 07 Jul 2020.

Vancouver:

Zhang P. Hardness and tractability for structured numerical problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/60735.

Council of Science Editors:

Zhang P. Hardness and tractability for structured numerical problems. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60735


Georgia Tech

7. Torrico Palacios, Alfredo Ignacio. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization.

Degree: PhD, Industrial and Systems Engineering, 2019, Georgia Tech

 Resource allocation and subset selection are two relevant classes of problems in the core of combinatorial optimization. Over the past decade, there has been an… (more)

Subjects/Keywords: Combinatorial optimization; Online optimization; Online bipartite matching; Constrained submodular maximization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Torrico Palacios, A. I. (2019). Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61720

Chicago Manual of Style (16th Edition):

Torrico Palacios, Alfredo Ignacio. “Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization.” 2019. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/61720.

MLA Handbook (7th Edition):

Torrico Palacios, Alfredo Ignacio. “Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization.” 2019. Web. 07 Jul 2020.

Vancouver:

Torrico Palacios AI. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/61720.

Council of Science Editors:

Torrico Palacios AI. Resource allocation and subset selection: new approaches at the interface between discrete and continuous optimization. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61720


Georgia Tech

8. Krone, Robert Carlton. Symmetric ideals and numerical primary decomposition.

Degree: PhD, Mathematics, 2015, Georgia Tech

 The thesis considers two distinct strategies for algebraic computation with polynomials in high dimension. The first concerns ideals and varieties with symmetry, which often arise… (more)

Subjects/Keywords: Numerical algebraic geometry; Commutative algebra; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krone, R. C. (2015). Symmetric ideals and numerical primary decomposition. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53907

Chicago Manual of Style (16th Edition):

Krone, Robert Carlton. “Symmetric ideals and numerical primary decomposition.” 2015. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/53907.

MLA Handbook (7th Edition):

Krone, Robert Carlton. “Symmetric ideals and numerical primary decomposition.” 2015. Web. 07 Jul 2020.

Vancouver:

Krone RC. Symmetric ideals and numerical primary decomposition. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/53907.

Council of Science Editors:

Krone RC. Symmetric ideals and numerical primary decomposition. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53907


Georgia Tech

9. Berlind, Christopher. New insights on the power of active learning.

Degree: PhD, Computer Science, 2015, Georgia Tech

 Traditional supervised machine learning algorithms are expected to have access to a large corpus of labeled examples, but the massive amount of data available in… (more)

Subjects/Keywords: Machine learning; Learning theory; Active learning; Semi-supervised learning; Domain adaptation; Large margin learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Berlind, C. (2015). New insights on the power of active learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53948

Chicago Manual of Style (16th Edition):

Berlind, Christopher. “New insights on the power of active learning.” 2015. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/53948.

MLA Handbook (7th Edition):

Berlind, Christopher. “New insights on the power of active learning.” 2015. Web. 07 Jul 2020.

Vancouver:

Berlind C. New insights on the power of active learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/53948.

Council of Science Editors:

Berlind C. New insights on the power of active learning. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53948

10. Yang, Linji. Phase transitions in spin systems: uniqueness, reconstruction and mixing time.

Degree: PhD, Computer Science, 2013, Georgia Tech

 Spin systems are powerful mathematical models widely used and studied in Statistical Physics and Computer Science. This thesis focuses the study of spin systems on… (more)

Subjects/Keywords: Spin systems; Glauber dynamics; Markov chain; Mixing time; Uniqueness; Phase transitions; Markov processes; Stochastic processes; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, L. (2013). Phase transitions in spin systems: uniqueness, reconstruction and mixing time. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/47593

Chicago Manual of Style (16th Edition):

Yang, Linji. “Phase transitions in spin systems: uniqueness, reconstruction and mixing time.” 2013. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/47593.

MLA Handbook (7th Edition):

Yang, Linji. “Phase transitions in spin systems: uniqueness, reconstruction and mixing time.” 2013. Web. 07 Jul 2020.

Vancouver:

Yang L. Phase transitions in spin systems: uniqueness, reconstruction and mixing time. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/47593.

Council of Science Editors:

Yang L. Phase transitions in spin systems: uniqueness, reconstruction and mixing time. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/47593

11. Guzman Paredes, Cristobal. Information, complexity and structure in convex optimization.

Degree: PhD, Industrial and Systems Engineering, 2015, Georgia Tech

 This thesis is focused on the limits of performance of large-scale convex optimization algorithms. Classical theory of oracle complexity, first proposed by Nemirovski and Yudin… (more)

Subjects/Keywords: Convex optimization; Optimization algorithms; Complexity theory; Lower bounds

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

Guzman Paredes, C. (2015). Information, complexity and structure in convex optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/53577

Chicago Manual of Style (16th Edition):

Guzman Paredes, Cristobal. “Information, complexity and structure in convex optimization.” 2015. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/53577.

MLA Handbook (7th Edition):

Guzman Paredes, Cristobal. “Information, complexity and structure in convex optimization.” 2015. Web. 07 Jul 2020.

Vancouver:

Guzman Paredes C. Information, complexity and structure in convex optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/53577.

Council of Science Editors:

Guzman Paredes C. Information, complexity and structure in convex optimization. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/53577

12. Louis, Anand. The complexity of expansion problems.

Degree: PhD, Computer Science, 2014, Georgia Tech

 Graph-partitioning problems are a central topic of research in the study of algorithms and complexity theory. They are of interest to theoreticians with connections to… (more)

Subjects/Keywords: Approximation algorithms; Discrete isoperimetry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Louis, A. (2014). The complexity of expansion problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52294

Chicago Manual of Style (16th Edition):

Louis, Anand. “The complexity of expansion problems.” 2014. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/52294.

MLA Handbook (7th Edition):

Louis, Anand. “The complexity of expansion problems.” 2014. Web. 07 Jul 2020.

Vancouver:

Louis A. The complexity of expansion problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/52294.

Council of Science Editors:

Louis A. The complexity of expansion problems. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52294

13. Khan, Arindam. Approximation algorithms for multidimensional bin packing.

Degree: PhD, Computer Science, 2015, Georgia Tech

 The bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical… (more)

Subjects/Keywords: Scheduling; Theoretical computer science; Approximation algorithms; Bin packing; Bipartite edge coloring; Geometric packing; Vector packing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khan, A. (2015). Approximation algorithms for multidimensional bin packing. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54371

Chicago Manual of Style (16th Edition):

Khan, Arindam. “Approximation algorithms for multidimensional bin packing.” 2015. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/54371.

MLA Handbook (7th Edition):

Khan, Arindam. “Approximation algorithms for multidimensional bin packing.” 2015. Web. 07 Jul 2020.

Vancouver:

Khan A. Approximation algorithms for multidimensional bin packing. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/54371.

Council of Science Editors:

Khan A. Approximation algorithms for multidimensional bin packing. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/54371

14. Saket, Rishi. Intractability results for problems in computational learning and approximation.

Degree: PhD, Computing, 2009, Georgia Tech

 In this thesis we prove intractability results for well studied problems in computational learning and approximation. Let ε , mu > 0 be arbitrarily small… (more)

Subjects/Keywords: Integrality gaps; Approximation; Hardness; Learning; Combinatorial optimization; Computational learning theory; Machine learning

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

Saket, R. (2009). Intractability results for problems in computational learning and approximation. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29681

Chicago Manual of Style (16th Edition):

Saket, Rishi. “Intractability results for problems in computational learning and approximation.” 2009. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/29681.

MLA Handbook (7th Edition):

Saket, Rishi. “Intractability results for problems in computational learning and approximation.” 2009. Web. 07 Jul 2020.

Vancouver:

Saket R. Intractability results for problems in computational learning and approximation. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/29681.

Council of Science Editors:

Saket R. Intractability results for problems in computational learning and approximation. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/29681

15. Zink, Daniel. A reduction framework for approximate extended formulations and a faster algorithm for convex optimization.

Degree: PhD, Industrial and Systems Engineering, 2017, Georgia Tech

 Linear programming (LP) and semidefinite programming (SDP) are among the most important tools in Operations Research and Computer Science. In this work we study the… (more)

Subjects/Keywords: Extended formulations; Linear programming; Semidefinite programming; Approximations; Convex optimization; Frank-Wolfe method; Conditional gradients

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zink, D. (2017). A reduction framework for approximate extended formulations and a faster algorithm for convex optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58274

Chicago Manual of Style (16th Edition):

Zink, Daniel. “A reduction framework for approximate extended formulations and a faster algorithm for convex optimization.” 2017. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/58274.

MLA Handbook (7th Edition):

Zink, Daniel. “A reduction framework for approximate extended formulations and a faster algorithm for convex optimization.” 2017. Web. 07 Jul 2020.

Vancouver:

Zink D. A reduction framework for approximate extended formulations and a faster algorithm for convex optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/58274.

Council of Science Editors:

Zink D. A reduction framework for approximate extended formulations and a faster algorithm for convex optimization. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58274

16. Blado, Daniel E. Relaxations for the dynamic knapsack problem with stochastic item sizes.

Degree: PhD, Industrial and Systems Engineering, 2018, Georgia Tech

 We consider a version of the knapsack problem in which an item size is random and revealed only when the decision maker attempts to insert… (more)

Subjects/Keywords: Optimization; Stochastic knapsack; Optimal policy; Dynamic programming; Bound/policy gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Blado, D. E. (2018). Relaxations for the dynamic knapsack problem with stochastic item sizes. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60199

Chicago Manual of Style (16th Edition):

Blado, Daniel E. “Relaxations for the dynamic knapsack problem with stochastic item sizes.” 2018. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/60199.

MLA Handbook (7th Edition):

Blado, Daniel E. “Relaxations for the dynamic knapsack problem with stochastic item sizes.” 2018. Web. 07 Jul 2020.

Vancouver:

Blado DE. Relaxations for the dynamic knapsack problem with stochastic item sizes. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/60199.

Council of Science Editors:

Blado DE. Relaxations for the dynamic knapsack problem with stochastic item sizes. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60199

17. Bailey, James P. The Price of deception in social choice.

Degree: PhD, Industrial and Systems Engineering, 2017, Georgia Tech

 Most social choice algorithms rely on private data from individuals to maximize a social utility. However, many algorithms are manipulable  – an individual can manipulate… (more)

Subjects/Keywords: Game theory; Price of deception; Minimal dishonesty; Social choice; Voting; Borda; Plurality; Copeland; Majority judgment; Veto; Facility location; Assignments; Stable marriage; Gale-Shapley; College admission; Student placement

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

Bailey, J. P. (2017). The Price of deception in social choice. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59189

Chicago Manual of Style (16th Edition):

Bailey, James P. “The Price of deception in social choice.” 2017. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/59189.

MLA Handbook (7th Edition):

Bailey, James P. “The Price of deception in social choice.” 2017. Web. 07 Jul 2020.

Vancouver:

Bailey JP. The Price of deception in social choice. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/59189.

Council of Science Editors:

Bailey JP. The Price of deception in social choice. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/59189

18. Huq, Arefin. The Complexity of Extended Formulations.

Degree: PhD, Computer Science, 2016, Georgia Tech

 Combinatorial optimization plays a central role in complexity theory, operations research, and algorithms. Extended formulations give a powerful approach to solve combinatorial optimization problems: if… (more)

Subjects/Keywords: Computational complexity; Combinatorial optimization; Extended formulations; Symmetry; Semidefinite programming; Copositive programming; Matching problem; Traveling salesperson problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huq, A. (2016). The Complexity of Extended Formulations. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55556

Chicago Manual of Style (16th Edition):

Huq, Arefin. “The Complexity of Extended Formulations.” 2016. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/55556.

MLA Handbook (7th Edition):

Huq, Arefin. “The Complexity of Extended Formulations.” 2016. Web. 07 Jul 2020.

Vancouver:

Huq A. The Complexity of Extended Formulations. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/55556.

Council of Science Editors:

Huq A. The Complexity of Extended Formulations. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55556

19. Hoyer, Alexander. On the independent spanning tree conjectures and related problems.

Degree: PhD, Mathematics, 2019, Georgia Tech

 We say that trees with common root are (edge-)independent if, for any vertex in their intersection, the paths to the root induced by each tree… (more)

Subjects/Keywords: Graph theory; Structural graph theory; Independent spanning tree conjecture; Edge-independent spanning tree conjecture; Connectivity; Edge-connectivity; Independent spanning trees; Edge-independent spanning trees; Ear decomposition; Chain decomposition; Graph decomposition; Györi-Lovász theorem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hoyer, A. (2019). On the independent spanning tree conjectures and related problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61777

Chicago Manual of Style (16th Edition):

Hoyer, Alexander. “On the independent spanning tree conjectures and related problems.” 2019. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/61777.

MLA Handbook (7th Edition):

Hoyer, Alexander. “On the independent spanning tree conjectures and related problems.” 2019. Web. 07 Jul 2020.

Vancouver:

Hoyer A. On the independent spanning tree conjectures and related problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/61777.

Council of Science Editors:

Hoyer A. On the independent spanning tree conjectures and related problems. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61777

20. Xie, Bo. Algorithms and analysis for non-convex optimization problems in machine learning.

Degree: PhD, Computational Science and Engineering, 2017, Georgia Tech

 In this thesis, we propose efficient algorithms and provide theoretical analysis through the angle of spectral methods for some important non-convex optimization problems in machine… (more)

Subjects/Keywords: Machine learning; Non-convex optimization; Spectral algorithms; Neural networks; Deep learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, B. (2017). Algorithms and analysis for non-convex optimization problems in machine learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58642

Chicago Manual of Style (16th Edition):

Xie, Bo. “Algorithms and analysis for non-convex optimization problems in machine learning.” 2017. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/58642.

MLA Handbook (7th Edition):

Xie, Bo. “Algorithms and analysis for non-convex optimization problems in machine learning.” 2017. Web. 07 Jul 2020.

Vancouver:

Xie B. Algorithms and analysis for non-convex optimization problems in machine learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/58642.

Council of Science Editors:

Xie B. Algorithms and analysis for non-convex optimization problems in machine learning. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58642

21. Chandrasekaran, Karthekeyan. New approaches to integer programming.

Degree: PhD, Algorithms, Combinatorics, and Optimization, 2012, Georgia Tech

 Integer Programming (IP) is a powerful and widely-used formulation for combinatorial problems. The study of IP over the past several decades has led to fascinating… (more)

Subjects/Keywords: Random graphs; Feedback vertex set; Cutting plane method; Integer program; Discrepancy; Random; Matching; Integer programming; Programming (Mathematics); Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chandrasekaran, K. (2012). New approaches to integer programming. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/44814

Chicago Manual of Style (16th Edition):

Chandrasekaran, Karthekeyan. “New approaches to integer programming.” 2012. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/44814.

MLA Handbook (7th Edition):

Chandrasekaran, Karthekeyan. “New approaches to integer programming.” 2012. Web. 07 Jul 2020.

Vancouver:

Chandrasekaran K. New approaches to integer programming. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/44814.

Council of Science Editors:

Chandrasekaran K. New approaches to integer programming. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/44814

22. Tyber, Steven Jay. Cutting planes in mixed integer programming: theory and algorithms.

Degree: PhD, Industrial and Systems Engineering, 2013, Georgia Tech

 Recent developments in mixed integer programming have highlighted the need for multi-row cuts. To this day, the performance of such cuts has typically fallen short… (more)

Subjects/Keywords: Integer programming; Superadditive lifting; Corner polyhedra; Finite group polyhedra; Fixed-charge flow; Knapsack; Integer programming; Operations research

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

Tyber, S. J. (2013). Cutting planes in mixed integer programming: theory and algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/47560

Chicago Manual of Style (16th Edition):

Tyber, Steven Jay. “Cutting planes in mixed integer programming: theory and algorithms.” 2013. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/47560.

MLA Handbook (7th Edition):

Tyber, Steven Jay. “Cutting planes in mixed integer programming: theory and algorithms.” 2013. Web. 07 Jul 2020.

Vancouver:

Tyber SJ. Cutting planes in mixed integer programming: theory and algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/47560.

Council of Science Editors:

Tyber SJ. Cutting planes in mixed integer programming: theory and algorithms. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/47560

23. Xiao, Ying. New tools for unsupervised learning.

Degree: PhD, Computer Science, 2014, Georgia Tech

 In an unsupervised learning problem, one is given an unlabelled dataset and hopes to find some hidden structure; the prototypical example is clustering similar data.… (more)

Subjects/Keywords: Tensor; Spectral decomposition; Unsupervised learning; Independent component analysis; Fourier transform; Gaussian mixture model; Feature selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiao, Y. (2014). New tools for unsupervised learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/52995

Chicago Manual of Style (16th Edition):

Xiao, Ying. “New tools for unsupervised learning.” 2014. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/52995.

MLA Handbook (7th Edition):

Xiao, Ying. “New tools for unsupervised learning.” 2014. Web. 07 Jul 2020.

Vancouver:

Xiao Y. New tools for unsupervised learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/52995.

Council of Science Editors:

Xiao Y. New tools for unsupervised learning. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/52995

24. Yun, Tae-Jung. Using ubiquitous communication technology to improve pediatric asthma management.

Degree: PhD, Computing, 2012, Georgia Tech

 Information and communication technologies (ICTs) for chronic care are increasingly being researched in Human-Computer Interaction. One of the current health management areas where ICTs have… (more)

Subjects/Keywords: HCI; HCC; Health; Ubicomp; Communication; Asthma; Ubiquitous computing; Information technology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yun, T. (2012). Using ubiquitous communication technology to improve pediatric asthma management. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/44794

Chicago Manual of Style (16th Edition):

Yun, Tae-Jung. “Using ubiquitous communication technology to improve pediatric asthma management.” 2012. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/44794.

MLA Handbook (7th Edition):

Yun, Tae-Jung. “Using ubiquitous communication technology to improve pediatric asthma management.” 2012. Web. 07 Jul 2020.

Vancouver:

Yun T. Using ubiquitous communication technology to improve pediatric asthma management. [Internet] [Doctoral dissertation]. Georgia Tech; 2012. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/44794.

Council of Science Editors:

Yun T. Using ubiquitous communication technology to improve pediatric asthma management. [Doctoral Dissertation]. Georgia Tech; 2012. Available from: http://hdl.handle.net/1853/44794

25. Ram, Parikshit. New paradigms for approximate nearest-neighbor search.

Degree: PhD, Computational Science and Engineering, 2013, Georgia Tech

 Nearest-neighbor search is a very natural and universal problem in computer science. Often times, the problem size necessitates approximation. In this thesis, I present new… (more)

Subjects/Keywords: Similarity search; Nearest-neighbor search; Computational geometry; Algorithms and analysis; Nearest neighbor analysis (Statistics); Approximation algorithms; Search theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ram, P. (2013). New paradigms for approximate nearest-neighbor search. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/49112

Chicago Manual of Style (16th Edition):

Ram, Parikshit. “New paradigms for approximate nearest-neighbor search.” 2013. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/49112.

MLA Handbook (7th Edition):

Ram, Parikshit. “New paradigms for approximate nearest-neighbor search.” 2013. Web. 07 Jul 2020.

Vancouver:

Ram P. New paradigms for approximate nearest-neighbor search. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/49112.

Council of Science Editors:

Ram P. New paradigms for approximate nearest-neighbor search. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/49112

26. Li, Zihao. Allocating resources to people with preferences.

Degree: PhD, Industrial and Systems Engineering, 2017, Georgia Tech

 Allocating Resources to People with Preferences Zihao Li 157 Pages Directed by Dr. Julie Swann Resource allocation can be viewed as the assignment of available… (more)

Subjects/Keywords: health services research; health access; vaccine allocation; public health policy; stable matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Z. (2017). Allocating resources to people with preferences. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58704

Chicago Manual of Style (16th Edition):

Li, Zihao. “Allocating resources to people with preferences.” 2017. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/58704.

MLA Handbook (7th Edition):

Li, Zihao. “Allocating resources to people with preferences.” 2017. Web. 07 Jul 2020.

Vancouver:

Li Z. Allocating resources to people with preferences. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/58704.

Council of Science Editors:

Li Z. Allocating resources to people with preferences. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58704

27. Roy, Aurko. LP and SDP extended formulations: Lower bounds and approximation algorithms.

Degree: PhD, Computer Science, 2017, Georgia Tech

 In this thesis we study various aspects of linear and semidefinite programs including their limitations in approximating various combinatorial optimization problems as well as applications… (more)

Subjects/Keywords: Extended formulation; Linear programming; Semidefinite programming; Machine learning; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roy, A. (2017). LP and SDP extended formulations: Lower bounds and approximation algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58666

Chicago Manual of Style (16th Edition):

Roy, Aurko. “LP and SDP extended formulations: Lower bounds and approximation algorithms.” 2017. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/58666.

MLA Handbook (7th Edition):

Roy, Aurko. “LP and SDP extended formulations: Lower bounds and approximation algorithms.” 2017. Web. 07 Jul 2020.

Vancouver:

Roy A. LP and SDP extended formulations: Lower bounds and approximation algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/58666.

Council of Science Editors:

Roy A. LP and SDP extended formulations: Lower bounds and approximation algorithms. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58666

28. Cousins, Benjamin. Efficient high-dimensional sampling and integration.

Degree: PhD, Computer Science, 2017, Georgia Tech

 Volume computation is an algorithmic version of the fundamental geometric problem to figure out how much space an object occupies. Related problems of sampling and… (more)

Subjects/Keywords: Sampling; Volume computation; Randomized algorithms; Markov chains; Isoperimetry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cousins, B. (2017). Efficient high-dimensional sampling and integration. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58671

Chicago Manual of Style (16th Edition):

Cousins, Benjamin. “Efficient high-dimensional sampling and integration.” 2017. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/58671.

MLA Handbook (7th Edition):

Cousins, Benjamin. “Efficient high-dimensional sampling and integration.” 2017. Web. 07 Jul 2020.

Vancouver:

Cousins B. Efficient high-dimensional sampling and integration. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/58671.

Council of Science Editors:

Cousins B. Efficient high-dimensional sampling and integration. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58671


Georgia Tech

29. Monu, Ruban. Design and implementation of a basic laboratory information system for resource-limited settings.

Degree: MS, Computing, 2010, Georgia Tech

 Basic Laboratory Information System (BLIS) is a joint initiative of C4G @ Georgia Tech, the Centers for Disease Control and Prevention (CDC) and Ministries of… (more)

Subjects/Keywords: Laboratory information systems; Computing for Good; ICT; Africa; Health care; End-user computing; Electronic data processing; Office practice Automation; Electronic filing systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Monu, R. (2010). Design and implementation of a basic laboratory information system for resource-limited settings. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/34792

Chicago Manual of Style (16th Edition):

Monu, Ruban. “Design and implementation of a basic laboratory information system for resource-limited settings.” 2010. Masters Thesis, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/34792.

MLA Handbook (7th Edition):

Monu, Ruban. “Design and implementation of a basic laboratory information system for resource-limited settings.” 2010. Web. 07 Jul 2020.

Vancouver:

Monu R. Design and implementation of a basic laboratory information system for resource-limited settings. [Internet] [Masters thesis]. Georgia Tech; 2010. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/34792.

Council of Science Editors:

Monu R. Design and implementation of a basic laboratory information system for resource-limited settings. [Masters Thesis]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/34792


Georgia Tech

30. Ponnuswami, Ashok Kumar. Intractability Results for some Computational Problems.

Degree: PhD, Computing, 2008, Georgia Tech

 In this thesis, we show results for some well-studied problems from learning theory and combinatorial optimization. Learning Parities under the Uniform Distribution: We study the… (more)

Subjects/Keywords: Hardness of approximation; Max-Clique; Agnostic learning; Parities; Halfspaces; Thresholds; Circuit lower bounds; Combinatorial optimization; Computational learning theory; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ponnuswami, A. K. (2008). Intractability Results for some Computational Problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24638

Chicago Manual of Style (16th Edition):

Ponnuswami, Ashok Kumar. “Intractability Results for some Computational Problems.” 2008. Doctoral Dissertation, Georgia Tech. Accessed July 07, 2020. http://hdl.handle.net/1853/24638.

MLA Handbook (7th Edition):

Ponnuswami, Ashok Kumar. “Intractability Results for some Computational Problems.” 2008. Web. 07 Jul 2020.

Vancouver:

Ponnuswami AK. Intractability Results for some Computational Problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2020 Jul 07]. Available from: http://hdl.handle.net/1853/24638.

Council of Science Editors:

Ponnuswami AK. Intractability Results for some Computational Problems. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24638

[1] [2]

.