Advanced search options

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

You searched for `subject:( convex)`

.
Showing records 1 – 30 of
1109 total matches.

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

Search Limiters

Dates

- 2016 – 2020 (436)
- 2011 – 2015 (425)
- 2006 – 2010 (173)
- 2001 – 2005 (50)
- 1996 – 2000 (26)
- 1991 – 1995 (15)

Universities

- National University of Singapore (29)
- University of Waterloo (29)
- Georgia Tech (28)
- University of California – Berkeley (26)
- NSYSU (22)
- Delft University of Technology (19)
- ETH Zürich (19)
- Texas A&M University (19)
- University of Illinois – Urbana-Champaign (18)
- University of Michigan (17)
- University of Minnesota (17)
- Virginia Tech (17)
- Penn State University (16)
- Université Paris-Est (14)
- University of Florida (14)

Department

- Mathematics (65)
- Electrical Engineering (36)
- Electrical and Computer Engineering (30)
- Informatique (25)
- Industrial and Systems Engineering (21)
- Computer Science (20)
- Mathématiques (18)
- Mathématiques appliquées (18)
- Department of Electrical and Computer Engineering (14)
- Applied Mathematics (13)
- Mechanical Engineering (13)
- Statistics (12)
- Electrical Engineering & Computer Sciences (11)

Degrees

- PhD (305)
- Docteur es (117)
- MS (69)
- Master (27)

Country

- US (484)
- France (117)
- Canada (95)
- Brazil (45)
- Australia (34)
- Netherlands (32)
- Singapore (29)
- Greece (28)
- Sweden (26)
- UK (26)
- Taiwan (22)
- Germany (21)
- Switzerland (19)
- India (15)
- Czech Republic (12)

▼ Search Limiters

Rutgers University

1. Gupta, Mayank, 1990-. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.

Degree: MS, Computer Science, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/

► In this article we consider the problem of testing, for two nite sets of points in the Euclidean space, if their *convex* hulls are disjoint…
(more)

Subjects/Keywords: Convex sets

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gupta, Mayank, 1. (2016). A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/49973/

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

Gupta, Mayank, 1990-. “A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.” 2016. Masters Thesis, Rutgers University. Accessed October 01, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/49973/.

MLA Handbook (7^{th} Edition):

Gupta, Mayank, 1990-. “A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.” 2016. Web. 01 Oct 2020.

Vancouver:

Gupta, Mayank 1. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. [Internet] [Masters thesis]. Rutgers University; 2016. [cited 2020 Oct 01]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/.

Council of Science Editors:

Gupta, Mayank 1. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. [Masters Thesis]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/

2. Uthayakumar, R. Study on convergence of optimization problems;.

Degree: 2014, INFLIBNET

URL: http://shodhganga.inflibnet.ac.in/handle/10603/17964

►

In this thesis, various notions of convergence of sequence of sets and functions and their applications in the convergence of the optimal values under the… (more)

Subjects/Keywords: Convergence; Convex; Functions; Non-convex; Optimization; Sets

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Uthayakumar, R. (2014). Study on convergence of optimization problems;. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/17964

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Uthayakumar, R. “Study on convergence of optimization problems;.” 2014. Thesis, INFLIBNET. Accessed October 01, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/17964.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Uthayakumar, R. “Study on convergence of optimization problems;.” 2014. Web. 01 Oct 2020.

Vancouver:

Uthayakumar R. Study on convergence of optimization problems;. [Internet] [Thesis]. INFLIBNET; 2014. [cited 2020 Oct 01]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17964.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Uthayakumar R. Study on convergence of optimization problems;. [Thesis]. INFLIBNET; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17964

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

3.
Kunin, Alexander.
Properties and Applications of *Convex* Neural Codes.

Degree: 2019, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/16900abk170

► The brain represents the physical world via the neural code, the patterns of activity of populations of neurons. One of the goals of mathematical neuroscience…
(more)

Subjects/Keywords: combinatorics; mathematical neuroscience; convex geometry; convex coding

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kunin, A. (2019). Properties and Applications of Convex Neural Codes. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/16900abk170

Not specified: Masters Thesis or Doctoral Dissertation

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

Kunin, Alexander. “Properties and Applications of Convex Neural Codes.” 2019. Thesis, Penn State University. Accessed October 01, 2020. https://submit-etda.libraries.psu.edu/catalog/16900abk170.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kunin, Alexander. “Properties and Applications of Convex Neural Codes.” 2019. Web. 01 Oct 2020.

Vancouver:

Kunin A. Properties and Applications of Convex Neural Codes. [Internet] [Thesis]. Penn State University; 2019. [cited 2020 Oct 01]. Available from: https://submit-etda.libraries.psu.edu/catalog/16900abk170.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kunin A. Properties and Applications of Convex Neural Codes. [Thesis]. Penn State University; 2019. Available from: https://submit-etda.libraries.psu.edu/catalog/16900abk170

Not specified: Masters Thesis or Doctoral Dissertation

University of Victoria

4.
Carr, MacKenzie.
Enumerating digitally *convex* sets in graphs.

Degree: Department of Mathematics and Statistics, 2020, University of Victoria

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

► Given a finite set V, a convexity, C, is a collection of subsets of V that contains both the empty set and the set V…
(more)

Subjects/Keywords: graph; convex; digitally convex; graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Carr, M. (2020). Enumerating digitally convex sets in graphs. (Masters Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/11938

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

Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Masters Thesis, University of Victoria. Accessed October 01, 2020. http://hdl.handle.net/1828/11938.

MLA Handbook (7^{th} Edition):

Carr, MacKenzie. “Enumerating digitally convex sets in graphs.” 2020. Web. 01 Oct 2020.

Vancouver:

Carr M. Enumerating digitally convex sets in graphs. [Internet] [Masters thesis]. University of Victoria; 2020. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1828/11938.

Council of Science Editors:

Carr M. Enumerating digitally convex sets in graphs. [Masters Thesis]. University of Victoria; 2020. Available from: http://hdl.handle.net/1828/11938

University of Sydney

5.
Majchrowski, Alexander.
* Convex* and Two-

Degree: 2018, University of Sydney

URL: http://hdl.handle.net/2123/19718

► We study both *convex* and two-*convex* hypersurfaces embedded in Euclidean space. In 2009 Huisken and Sinestrari were able to classify surfaces undergoing two-*convex* mean curvature…
(more)

Subjects/Keywords: hypersurfaces; flow; mean curvature; convex; two-convex

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Majchrowski, A. (2018). Convex and Two-Convex Hypersurfaces Along Exterior Flows . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/19718

Not specified: Masters Thesis or Doctoral Dissertation

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

Majchrowski, Alexander. “Convex and Two-Convex Hypersurfaces Along Exterior Flows .” 2018. Thesis, University of Sydney. Accessed October 01, 2020. http://hdl.handle.net/2123/19718.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Majchrowski, Alexander. “Convex and Two-Convex Hypersurfaces Along Exterior Flows .” 2018. Web. 01 Oct 2020.

Vancouver:

Majchrowski A. Convex and Two-Convex Hypersurfaces Along Exterior Flows . [Internet] [Thesis]. University of Sydney; 2018. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2123/19718.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Majchrowski A. Convex and Two-Convex Hypersurfaces Along Exterior Flows . [Thesis]. University of Sydney; 2018. Available from: http://hdl.handle.net/2123/19718

Not specified: Masters Thesis or Doctoral Dissertation

University of Ottawa

6.
Wang, Pengfei.
An Approximate MCMC Method for *Convex* Hulls
.

Degree: 2019, University of Ottawa

URL: http://hdl.handle.net/10393/39529

► Markov chain Monte Carlo (MCMC) is an extremely popular class of algorithms for computing summaries of posterior distributions. One problem for MCMC in the so-called…
(more)

Subjects/Keywords: MCMC; convex hull

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, P. (2019). An Approximate MCMC Method for Convex Hulls . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/39529

Not specified: Masters Thesis or Doctoral Dissertation

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

Wang, Pengfei. “An Approximate MCMC Method for Convex Hulls .” 2019. Thesis, University of Ottawa. Accessed October 01, 2020. http://hdl.handle.net/10393/39529.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Pengfei. “An Approximate MCMC Method for Convex Hulls .” 2019. Web. 01 Oct 2020.

Vancouver:

Wang P. An Approximate MCMC Method for Convex Hulls . [Internet] [Thesis]. University of Ottawa; 2019. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10393/39529.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang P. An Approximate MCMC Method for Convex Hulls . [Thesis]. University of Ottawa; 2019. Available from: http://hdl.handle.net/10393/39529

Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

7. Pratap, Rajiv. Low Correlation Codes for Sonar Systems.

Degree: 2016, Victoria University of Wellington

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

► Sonar is a vital technology for the detection of objects in the water. Sonarsystems have been redefined over many decades, but research is still beingconducted…
(more)

Subjects/Keywords: Correlation; Sonar; Convex

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pratap, R. (2016). Low Correlation Codes for Sonar Systems. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/9092

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

Pratap, Rajiv. “Low Correlation Codes for Sonar Systems.” 2016. Masters Thesis, Victoria University of Wellington. Accessed October 01, 2020. http://hdl.handle.net/10063/9092.

MLA Handbook (7^{th} Edition):

Pratap, Rajiv. “Low Correlation Codes for Sonar Systems.” 2016. Web. 01 Oct 2020.

Vancouver:

Pratap R. Low Correlation Codes for Sonar Systems. [Internet] [Masters thesis]. Victoria University of Wellington; 2016. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10063/9092.

Council of Science Editors:

Pratap R. Low Correlation Codes for Sonar Systems. [Masters Thesis]. Victoria University of Wellington; 2016. Available from: http://hdl.handle.net/10063/9092

University of Alberta

8.
Cheng, Hao.
Bregman Divergence Clustering: A *Convex* Approach.

Degree: MS, Department of Computing Science, 2013, University of Alberta

URL: https://era.library.ualberta.ca/files/6d56zz264

► Due to its wide application in various fields, clustering, as a fundamental unsupervised learning problem, has been intensively investigated over the past few decades. Unfortunately,…
(more)

Subjects/Keywords: convex; clustering; Bregman divergence

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cheng, H. (2013). Bregman Divergence Clustering: A Convex Approach. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/6d56zz264

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

Cheng, Hao. “Bregman Divergence Clustering: A Convex Approach.” 2013. Masters Thesis, University of Alberta. Accessed October 01, 2020. https://era.library.ualberta.ca/files/6d56zz264.

MLA Handbook (7^{th} Edition):

Cheng, Hao. “Bregman Divergence Clustering: A Convex Approach.” 2013. Web. 01 Oct 2020.

Vancouver:

Cheng H. Bregman Divergence Clustering: A Convex Approach. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2020 Oct 01]. Available from: https://era.library.ualberta.ca/files/6d56zz264.

Council of Science Editors:

Cheng H. Bregman Divergence Clustering: A Convex Approach. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/6d56zz264

University of Georgia

9.
Sharpe, Sheree Taisha.
Random hyperplanes of a *convex* body, Sylvester's problem and Crofton's formula.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/24279

► Motivated by a problem on the 67th William Lowell Putnam Mathematical Competition, we will summarize three different solutions found on a website. This Putman problem…
(more)

Subjects/Keywords: Crofton\'s Formula; Convex Body

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sharpe, S. T. (2014). Random hyperplanes of a convex body, Sylvester's problem and Crofton's formula. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/24279

Not specified: Masters Thesis or Doctoral Dissertation

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

Sharpe, Sheree Taisha. “Random hyperplanes of a convex body, Sylvester's problem and Crofton's formula.” 2014. Thesis, University of Georgia. Accessed October 01, 2020. http://hdl.handle.net/10724/24279.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sharpe, Sheree Taisha. “Random hyperplanes of a convex body, Sylvester's problem and Crofton's formula.” 2014. Web. 01 Oct 2020.

Vancouver:

Sharpe ST. Random hyperplanes of a convex body, Sylvester's problem and Crofton's formula. [Internet] [Thesis]. University of Georgia; 2014. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10724/24279.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sharpe ST. Random hyperplanes of a convex body, Sylvester's problem and Crofton's formula. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/24279

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

10.
Ghosh, Mukulika.
Fast Approximate *Convex* Decomposition.

Degree: MS, Computer Science, 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873

► Approximate *convex* decomposition (ACD) is a technique that partitions an input object into "approximately *convex*" components. Decomposition into approximately *convex* pieces is both more efficient…
(more)

Subjects/Keywords: Convex Decomposition; Computational Geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ghosh, M. (2012). Fast Approximate Convex Decomposition. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873

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

Ghosh, Mukulika. “Fast Approximate Convex Decomposition.” 2012. Masters Thesis, Texas A&M University. Accessed October 01, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873.

MLA Handbook (7^{th} Edition):

Ghosh, Mukulika. “Fast Approximate Convex Decomposition.” 2012. Web. 01 Oct 2020.

Vancouver:

Ghosh M. Fast Approximate Convex Decomposition. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873.

Council of Science Editors:

Ghosh M. Fast Approximate Convex Decomposition. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873

University of British Columbia

11.
Seidel, Raimund.
A *convex* hull algorithm optimal for point sets in even dimensions
.

Degree: 1981, University of British Columbia

URL: http://hdl.handle.net/2429/22652

► Finding the *convex* hull of a finite set of points is important not only for practical applications but also for theoretical reasons: a number of…
(more)

Subjects/Keywords: Convex programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Seidel, R. (1981). A convex hull algorithm optimal for point sets in even dimensions . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/22652

Not specified: Masters Thesis or Doctoral Dissertation

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

Seidel, Raimund. “A convex hull algorithm optimal for point sets in even dimensions .” 1981. Thesis, University of British Columbia. Accessed October 01, 2020. http://hdl.handle.net/2429/22652.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Seidel, Raimund. “A convex hull algorithm optimal for point sets in even dimensions .” 1981. Web. 01 Oct 2020.

Vancouver:

Seidel R. A convex hull algorithm optimal for point sets in even dimensions . [Internet] [Thesis]. University of British Columbia; 1981. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2429/22652.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Seidel R. A convex hull algorithm optimal for point sets in even dimensions . [Thesis]. University of British Columbia; 1981. Available from: http://hdl.handle.net/2429/22652

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

12. Zhang, Shu-Bin. Study on Digital Filter Design and Coefficient Quantization.

Degree: Master, Communications Engineering, 2011, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727111-135237

► In this thesis, the basic theory is *convex* optimization theory[1]. And we study the problem about how to transfer to *convex* optimization problem from the…
(more)

Subjects/Keywords: Filter; Optimization; Convex; Bits; Quantization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, S. (2011). Study on Digital Filter Design and Coefficient Quantization. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727111-135237

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Shu-Bin. “Study on Digital Filter Design and Coefficient Quantization.” 2011. Thesis, NSYSU. Accessed October 01, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727111-135237.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Shu-Bin. “Study on Digital Filter Design and Coefficient Quantization.” 2011. Web. 01 Oct 2020.

Vancouver:

Zhang S. Study on Digital Filter Design and Coefficient Quantization. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Oct 01]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727111-135237.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang S. Study on Digital Filter Design and Coefficient Quantization. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0727111-135237

Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

13.
Jellyman, Dayle Raymond.
* Convex* Optimization for Distributed Acoustic Beamforming.

Degree: 2017, Victoria University of Wellington

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

► Beamforming filter optimization can be performed over a distributed wireless sensor network, but the output calculation remains either centralized or linked in time to the…
(more)

Subjects/Keywords: Distributed; Beamforming; Convex optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jellyman, D. R. (2017). Convex Optimization for Distributed Acoustic Beamforming. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/6650

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

Jellyman, Dayle Raymond. “Convex Optimization for Distributed Acoustic Beamforming.” 2017. Masters Thesis, Victoria University of Wellington. Accessed October 01, 2020. http://hdl.handle.net/10063/6650.

MLA Handbook (7^{th} Edition):

Jellyman, Dayle Raymond. “Convex Optimization for Distributed Acoustic Beamforming.” 2017. Web. 01 Oct 2020.

Vancouver:

Jellyman DR. Convex Optimization for Distributed Acoustic Beamforming. [Internet] [Masters thesis]. Victoria University of Wellington; 2017. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10063/6650.

Council of Science Editors:

Jellyman DR. Convex Optimization for Distributed Acoustic Beamforming. [Masters Thesis]. Victoria University of Wellington; 2017. Available from: http://hdl.handle.net/10063/6650

Oregon State University

14. Adams, Patrick Guy. A numerical approach to Tamme's problem in euclidean n-space.

Degree: MS, Mathematics, 1997, Oregon State University

URL: http://hdl.handle.net/1957/33911

Subjects/Keywords: Convex surfaces

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Adams, P. G. (1997). A numerical approach to Tamme's problem in euclidean n-space. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/33911

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

Adams, Patrick Guy. “A numerical approach to Tamme's problem in euclidean n-space.” 1997. Masters Thesis, Oregon State University. Accessed October 01, 2020. http://hdl.handle.net/1957/33911.

MLA Handbook (7^{th} Edition):

Adams, Patrick Guy. “A numerical approach to Tamme's problem in euclidean n-space.” 1997. Web. 01 Oct 2020.

Vancouver:

Adams PG. A numerical approach to Tamme's problem in euclidean n-space. [Internet] [Masters thesis]. Oregon State University; 1997. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1957/33911.

Council of Science Editors:

Adams PG. A numerical approach to Tamme's problem in euclidean n-space. [Masters Thesis]. Oregon State University; 1997. Available from: http://hdl.handle.net/1957/33911

Oregon State University

15. Ogard, Steven Phillip. Vector sums of line segments.

Degree: MS, Mathematics, 1965, Oregon State University

URL: http://hdl.handle.net/1957/47994

The author shows that a necessary and sufficient condition
for a convex polyhedron to be representable as a finite vector sum
of line segments is that each of its faces possesses central symmetry.

Subjects/Keywords: Convex bodies

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ogard, S. P. (1965). Vector sums of line segments. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/47994

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

Ogard, Steven Phillip. “Vector sums of line segments.” 1965. Masters Thesis, Oregon State University. Accessed October 01, 2020. http://hdl.handle.net/1957/47994.

MLA Handbook (7^{th} Edition):

Ogard, Steven Phillip. “Vector sums of line segments.” 1965. Web. 01 Oct 2020.

Vancouver:

Ogard SP. Vector sums of line segments. [Internet] [Masters thesis]. Oregon State University; 1965. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1957/47994.

Council of Science Editors:

Ogard SP. Vector sums of line segments. [Masters Thesis]. Oregon State University; 1965. Available from: http://hdl.handle.net/1957/47994

Oregon State University

16.
McGee, Keane B.
Generalized *convex* bodies of revolution in n-dimensional space.

Degree: PhD, Mathematics, 1978, Oregon State University

URL: http://hdl.handle.net/1957/17125

See pdf
*Advisors/Committee Members: Firey, William J. (advisor).*

Subjects/Keywords: Convex bodies

Record Details Similar Records

❌

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

APA (6^{th} Edition):

McGee, K. B. (1978). Generalized convex bodies of revolution in n-dimensional space. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17125

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

McGee, Keane B. “Generalized convex bodies of revolution in n-dimensional space.” 1978. Doctoral Dissertation, Oregon State University. Accessed October 01, 2020. http://hdl.handle.net/1957/17125.

MLA Handbook (7^{th} Edition):

McGee, Keane B. “Generalized convex bodies of revolution in n-dimensional space.” 1978. Web. 01 Oct 2020.

Vancouver:

McGee KB. Generalized convex bodies of revolution in n-dimensional space. [Internet] [Doctoral dissertation]. Oregon State University; 1978. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1957/17125.

Council of Science Editors:

McGee KB. Generalized convex bodies of revolution in n-dimensional space. [Doctoral Dissertation]. Oregon State University; 1978. Available from: http://hdl.handle.net/1957/17125

Oregon State University

17.
Lindquist, Norman Fred.
Representations of central *convex* bodies.

Degree: PhD, Mathematics, 1968, Oregon State University

URL: http://hdl.handle.net/1957/17195

See pdf
*Advisors/Committee Members: Firey, William J. (advisor).*

Subjects/Keywords: Convex bodies

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lindquist, N. F. (1968). Representations of central convex bodies. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17195

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

Lindquist, Norman Fred. “Representations of central convex bodies.” 1968. Doctoral Dissertation, Oregon State University. Accessed October 01, 2020. http://hdl.handle.net/1957/17195.

MLA Handbook (7^{th} Edition):

Lindquist, Norman Fred. “Representations of central convex bodies.” 1968. Web. 01 Oct 2020.

Vancouver:

Lindquist NF. Representations of central convex bodies. [Internet] [Doctoral dissertation]. Oregon State University; 1968. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1957/17195.

Council of Science Editors:

Lindquist NF. Representations of central convex bodies. [Doctoral Dissertation]. Oregon State University; 1968. Available from: http://hdl.handle.net/1957/17195

Oregon State University

18.
Kan, Joseph Ting-che.
Paley-Wiener theorems with *convex* weight functions.

Degree: PhD, Mathematics, 1976, Oregon State University

URL: http://hdl.handle.net/1957/17500

See pdf.
*Advisors/Committee Members: Petersen, Bent E. (advisor).*

Subjects/Keywords: Convex functions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kan, J. T. (1976). Paley-Wiener theorems with convex weight functions. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/17500

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

Kan, Joseph Ting-che. “Paley-Wiener theorems with convex weight functions.” 1976. Doctoral Dissertation, Oregon State University. Accessed October 01, 2020. http://hdl.handle.net/1957/17500.

MLA Handbook (7^{th} Edition):

Kan, Joseph Ting-che. “Paley-Wiener theorems with convex weight functions.” 1976. Web. 01 Oct 2020.

Vancouver:

Kan JT. Paley-Wiener theorems with convex weight functions. [Internet] [Doctoral dissertation]. Oregon State University; 1976. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/1957/17500.

Council of Science Editors:

Kan JT. Paley-Wiener theorems with convex weight functions. [Doctoral Dissertation]. Oregon State University; 1976. Available from: http://hdl.handle.net/1957/17500

Université Catholique de Louvain

19.
Martin, Benoît.
Autonomous microgrids for rural electrification : joint investment planning of power generation and distribution through *convex* optimization.

Degree: 2018, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/214246

►

Autonomous microgrid planning requires to consider both investments in network and generation assets as there is no connection to another power system. In this problem,… (more)

Subjects/Keywords: Planning; Microgrid; Convex optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Martin, B. (2018). Autonomous microgrids for rural electrification : joint investment planning of power generation and distribution through convex optimization. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/214246

Not specified: Masters Thesis or Doctoral Dissertation

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

Martin, Benoît. “Autonomous microgrids for rural electrification : joint investment planning of power generation and distribution through convex optimization.” 2018. Thesis, Université Catholique de Louvain. Accessed October 01, 2020. http://hdl.handle.net/2078.1/214246.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Martin, Benoît. “Autonomous microgrids for rural electrification : joint investment planning of power generation and distribution through convex optimization.” 2018. Web. 01 Oct 2020.

Vancouver:

Martin B. Autonomous microgrids for rural electrification : joint investment planning of power generation and distribution through convex optimization. [Internet] [Thesis]. Université Catholique de Louvain; 2018. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2078.1/214246.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Martin B. Autonomous microgrids for rural electrification : joint investment planning of power generation and distribution through convex optimization. [Thesis]. Université Catholique de Louvain; 2018. Available from: http://hdl.handle.net/2078.1/214246

Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

20. Berning, Andrew Walter, Jr. Verification of successive convexification algorithm.

Degree: MSin Engineering, Aerospace engineering, 2016, University of Texas – Austin

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

► In this report, I describe a technique which allows a non-*convex* optimal control problem to be expressed and solved in a *convex* manner. I then…
(more)

Subjects/Keywords: Convex; Convexification; Optimization; Verification

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Berning, Andrew Walter, J. (2016). Verification of successive convexification algorithm. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/41579

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

Berning, Andrew Walter, Jr. “Verification of successive convexification algorithm.” 2016. Masters Thesis, University of Texas – Austin. Accessed October 01, 2020. http://hdl.handle.net/2152/41579.

MLA Handbook (7^{th} Edition):

Berning, Andrew Walter, Jr. “Verification of successive convexification algorithm.” 2016. Web. 01 Oct 2020.

Vancouver:

Berning, Andrew Walter J. Verification of successive convexification algorithm. [Internet] [Masters thesis]. University of Texas – Austin; 2016. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2152/41579.

Council of Science Editors:

Berning, Andrew Walter J. Verification of successive convexification algorithm. [Masters Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/41579

University of Texas – Austin

21.
Wang, Ye, Ph. D.
Novel *convex* optimization techniques for circuit analysis and synthesis.

Degree: PhD, Electrical and Computer Engineering, 2018, University of Texas – Austin

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

► Technology scaling brings about the need for computationally efficient methods for circuit analysis, optimization, and synthesis. *Convex* optimization is a special class of mathematical optimization…
(more)

Subjects/Keywords: Convex optimization; EDA problems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Ye, P. D. (2018). Novel convex optimization techniques for circuit analysis and synthesis. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/67661

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

Wang, Ye, Ph D. “Novel convex optimization techniques for circuit analysis and synthesis.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed October 01, 2020. http://hdl.handle.net/2152/67661.

MLA Handbook (7^{th} Edition):

Wang, Ye, Ph D. “Novel convex optimization techniques for circuit analysis and synthesis.” 2018. Web. 01 Oct 2020.

Vancouver:

Wang, Ye PD. Novel convex optimization techniques for circuit analysis and synthesis. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2152/67661.

Council of Science Editors:

Wang, Ye PD. Novel convex optimization techniques for circuit analysis and synthesis. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/67661

Rutgers University

22. Yao, Wang, 1985-. Approximate versions of the alternating direction method of multipliers.

Degree: PhD, Operations Research, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/51517/

►

*Convex* optimization is at the core of many of today's analysis tools for large datasets, and in particular machine learning methods. This thesis will develop…
(more)

Subjects/Keywords: Mathematical optimization; Convex functions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yao, Wang, 1. (2016). Approximate versions of the alternating direction method of multipliers. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51517/

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

Yao, Wang, 1985-. “Approximate versions of the alternating direction method of multipliers.” 2016. Doctoral Dissertation, Rutgers University. Accessed October 01, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/51517/.

MLA Handbook (7^{th} Edition):

Yao, Wang, 1985-. “Approximate versions of the alternating direction method of multipliers.” 2016. Web. 01 Oct 2020.

Vancouver:

Yao, Wang 1. Approximate versions of the alternating direction method of multipliers. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Oct 01]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51517/.

Council of Science Editors:

Yao, Wang 1. Approximate versions of the alternating direction method of multipliers. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51517/

Rutgers University

23.
Misra, Gaurav, 1989-.
* Convex* optimization based planning and control methods for space-robotic systems.

Degree: PhD, Mechanical and Aerospace Engineering, 2019, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/61814/

► Space-robotic systems are arguably the most promising technologies available currently for on-orbit satellite operations including docking, berthing, and repair, which have been demonstrated in typically…
(more)

Subjects/Keywords: Space robotics; Convex programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Misra, Gaurav, 1. (2019). Convex optimization based planning and control methods for space-robotic systems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/61814/

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

Misra, Gaurav, 1989-. “Convex optimization based planning and control methods for space-robotic systems.” 2019. Doctoral Dissertation, Rutgers University. Accessed October 01, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/61814/.

MLA Handbook (7^{th} Edition):

Misra, Gaurav, 1989-. “Convex optimization based planning and control methods for space-robotic systems.” 2019. Web. 01 Oct 2020.

Vancouver:

Misra, Gaurav 1. Convex optimization based planning and control methods for space-robotic systems. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2020 Oct 01]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61814/.

Council of Science Editors:

Misra, Gaurav 1. Convex optimization based planning and control methods for space-robotic systems. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61814/

Rochester Institute of Technology

24.
Nelson, Trevor.
Geometric Properties and a Combinatorial Analysis of *Convex* Polygons Constructed of Tridrafters.

Degree: MS, School of Mathematical Sciences (COS), 2018, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/9776

► The aim of this thesis is to show how the use of parity in tandem with the triangular grid as well as a newly…
(more)

Subjects/Keywords: Combinatorics; Convex; Drafters; Geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nelson, T. (2018). Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9776

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

Nelson, Trevor. “Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters.” 2018. Masters Thesis, Rochester Institute of Technology. Accessed October 01, 2020. https://scholarworks.rit.edu/theses/9776.

MLA Handbook (7^{th} Edition):

Nelson, Trevor. “Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters.” 2018. Web. 01 Oct 2020.

Vancouver:

Nelson T. Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters. [Internet] [Masters thesis]. Rochester Institute of Technology; 2018. [cited 2020 Oct 01]. Available from: https://scholarworks.rit.edu/theses/9776.

Council of Science Editors:

Nelson T. Geometric Properties and a Combinatorial Analysis of Convex Polygons Constructed of Tridrafters. [Masters Thesis]. Rochester Institute of Technology; 2018. Available from: https://scholarworks.rit.edu/theses/9776

University of Illinois – Urbana-Champaign

25. Suwannaphichat, Sineenuch. Extremal functions related to convexity and martingales.

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

URL: http://hdl.handle.net/2142/50350

► We consider the problem of finding the extremal function in the class of real-valued biconvex functions satisfying a boundary condition on a product of the…
(more)

Subjects/Keywords: Extremal functions; Convex functions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Suwannaphichat, S. (2014). Extremal functions related to convexity and martingales. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50350

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

Suwannaphichat, Sineenuch. “Extremal functions related to convexity and martingales.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed October 01, 2020. http://hdl.handle.net/2142/50350.

MLA Handbook (7^{th} Edition):

Suwannaphichat, Sineenuch. “Extremal functions related to convexity and martingales.” 2014. Web. 01 Oct 2020.

Vancouver:

Suwannaphichat S. Extremal functions related to convexity and martingales. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2142/50350.

Council of Science Editors:

Suwannaphichat S. Extremal functions related to convexity and martingales. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50350

Texas Tech University

26. Meegaskumbura, Rochana. Control Theoretic Smoothing Splines with Derivative Constraints.

Degree: 2011, Texas Tech University

URL: http://hdl.handle.net/2346/ETD-TTU-2011-08-1674

► Over the recent years constrained smoothing splines have drawn much attention and significant amount of research is being done in this area. In this dissertation…
(more)

Subjects/Keywords: Smoothing splines; Convex splines

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Meegaskumbura, R. (2011). Control Theoretic Smoothing Splines with Derivative Constraints. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/ETD-TTU-2011-08-1674

Not specified: Masters Thesis or Doctoral Dissertation

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

Meegaskumbura, Rochana. “Control Theoretic Smoothing Splines with Derivative Constraints.” 2011. Thesis, Texas Tech University. Accessed October 01, 2020. http://hdl.handle.net/2346/ETD-TTU-2011-08-1674.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Meegaskumbura, Rochana. “Control Theoretic Smoothing Splines with Derivative Constraints.” 2011. Web. 01 Oct 2020.

Vancouver:

Meegaskumbura R. Control Theoretic Smoothing Splines with Derivative Constraints. [Internet] [Thesis]. Texas Tech University; 2011. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2346/ETD-TTU-2011-08-1674.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Meegaskumbura R. Control Theoretic Smoothing Splines with Derivative Constraints. [Thesis]. Texas Tech University; 2011. Available from: http://hdl.handle.net/2346/ETD-TTU-2011-08-1674

Not specified: Masters Thesis or Doctoral Dissertation

University of Arizona

27. Cohen, Stephen Burton, 1940-. MEASURES OF CONVEXITY .

Degree: 1970, University of Arizona

URL: http://hdl.handle.net/10150/287543

Subjects/Keywords: Convex domains.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cohen, Stephen Burton, 1. (1970). MEASURES OF CONVEXITY . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/287543

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

Cohen, Stephen Burton, 1940-. “MEASURES OF CONVEXITY .” 1970. Doctoral Dissertation, University of Arizona. Accessed October 01, 2020. http://hdl.handle.net/10150/287543.

MLA Handbook (7^{th} Edition):

Cohen, Stephen Burton, 1940-. “MEASURES OF CONVEXITY .” 1970. Web. 01 Oct 2020.

Vancouver:

Cohen, Stephen Burton 1. MEASURES OF CONVEXITY . [Internet] [Doctoral dissertation]. University of Arizona; 1970. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10150/287543.

Council of Science Editors:

Cohen, Stephen Burton 1. MEASURES OF CONVEXITY . [Doctoral Dissertation]. University of Arizona; 1970. Available from: http://hdl.handle.net/10150/287543

University of British Columbia

28. Wilker, John Brian. Open disk packings of a disk .

Degree: 1966, University of British Columbia

URL: http://hdl.handle.net/2429/37326

► A packing of the plane unit disk U by an infinite collection of smaller disks [symbol omitted] = {Dn} is a non-over lapping arrangement of…
(more)

Subjects/Keywords: Convex domains

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wilker, J. B. (1966). Open disk packings of a disk . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/37326

Not specified: Masters Thesis or Doctoral Dissertation

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

Wilker, John Brian. “Open disk packings of a disk .” 1966. Thesis, University of British Columbia. Accessed October 01, 2020. http://hdl.handle.net/2429/37326.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wilker, John Brian. “Open disk packings of a disk .” 1966. Web. 01 Oct 2020.

Vancouver:

Wilker JB. Open disk packings of a disk . [Internet] [Thesis]. University of British Columbia; 1966. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/2429/37326.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wilker JB. Open disk packings of a disk . [Thesis]. University of British Columbia; 1966. Available from: http://hdl.handle.net/2429/37326

Not specified: Masters Thesis or Doctoral Dissertation

29.
Cosentino, Alessandro.
Quantum State Local Distinguishability via *Convex* Optimization.

Degree: 2015, University of Waterloo

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

► Entanglement and nonlocality play a fundamental role in quantum computing. To understand the interplay between these phenomena, researchers have considered the model of local operations…
(more)

Subjects/Keywords: quantum information; convex optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cosentino, A. (2015). Quantum State Local Distinguishability via Convex Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9572

Not specified: Masters Thesis or Doctoral Dissertation

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

Cosentino, Alessandro. “Quantum State Local Distinguishability via Convex Optimization.” 2015. Thesis, University of Waterloo. Accessed October 01, 2020. http://hdl.handle.net/10012/9572.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Cosentino, Alessandro. “Quantum State Local Distinguishability via Convex Optimization.” 2015. Web. 01 Oct 2020.

Vancouver:

Cosentino A. Quantum State Local Distinguishability via Convex Optimization. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2020 Oct 01]. Available from: http://hdl.handle.net/10012/9572.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cosentino A. Quantum State Local Distinguishability via Convex Optimization. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9572

Not specified: Masters Thesis or Doctoral Dissertation

University of Missouri – Columbia

30.
Spencer, Patrick, 1987-.
Some results in *convex* geometry.

Degree: 2016, University of Missouri – Columbia

URL: https://doi.org/10.32469/10355/56989

► This thesis is divided into four parts. The first part is about proving that the unit ball of the Lorentz space is not an intersection…
(more)

Subjects/Keywords: Convex geometry; Lorentz spaces

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Spencer, Patrick, 1. (2016). Some results in convex geometry. (Thesis). University of Missouri – Columbia. Retrieved from https://doi.org/10.32469/10355/56989

Not specified: Masters Thesis or Doctoral Dissertation

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

Spencer, Patrick, 1987-. “Some results in convex geometry.” 2016. Thesis, University of Missouri – Columbia. Accessed October 01, 2020. https://doi.org/10.32469/10355/56989.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Spencer, Patrick, 1987-. “Some results in convex geometry.” 2016. Web. 01 Oct 2020.

Vancouver:

Spencer, Patrick 1. Some results in convex geometry. [Internet] [Thesis]. University of Missouri – Columbia; 2016. [cited 2020 Oct 01]. Available from: https://doi.org/10.32469/10355/56989.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Spencer, Patrick 1. Some results in convex geometry. [Thesis]. University of Missouri – Columbia; 2016. Available from: https://doi.org/10.32469/10355/56989

Not specified: Masters Thesis or Doctoral Dissertation