Advanced search options

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

You searched for `subject:(nuclear norm)`

.
Showing records 1 – 14 of
14 total matches.

▼ Search Limiters

1. Finell, Frida. Är alla föräldrar lika välkomna i förskolan? : En studie i hur samkönade föräldrapar upplevde deras barns start i förskolan.

Degree: Teacher Education, 2013, Södertörn University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-21212

► The purpose of this study is to see a display on how family, gender and sexuality are produced in four same-sex parents’ stories about…
(more)

Subjects/Keywords: Heteronormativity; Stereotyping; Norm; Nuclear family; Rainbow family; Heteronormativitet; Stereotypisering; Norm; Kärnfamilj; Regnbågsfamilj

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Finell, F. (2013). Är alla föräldrar lika välkomna i förskolan? : En studie i hur samkönade föräldrapar upplevde deras barns start i förskolan. (Thesis). Södertörn University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-21212

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

Finell, Frida. “Är alla föräldrar lika välkomna i förskolan? : En studie i hur samkönade föräldrapar upplevde deras barns start i förskolan.” 2013. Thesis, Södertörn University. Accessed December 10, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-21212.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Finell, Frida. “Är alla föräldrar lika välkomna i förskolan? : En studie i hur samkönade föräldrapar upplevde deras barns start i förskolan.” 2013. Web. 10 Dec 2019.

Vancouver:

Finell F. Är alla föräldrar lika välkomna i förskolan? : En studie i hur samkönade föräldrapar upplevde deras barns start i förskolan. [Internet] [Thesis]. Södertörn University; 2013. [cited 2019 Dec 10]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-21212.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Finell F. Är alla föräldrar lika välkomna i förskolan? : En studie i hur samkönade föräldrapar upplevde deras barns start i förskolan. [Thesis]. Södertörn University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-21212

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

2. Bardakci, Ibrahim Ekrem. Approximate Realization of Hidden Markov Models.

Degree: MS, Electrical Engineering, 2014, Penn State University

URL: https://etda.libraries.psu.edu/catalog/23697

► The realization problem for hidden Markov models (HMMs) has been studied over years. However, it does not always have solution and requires the exact string…
(more)

Subjects/Keywords: Hidden Markov Model; Approximate Realization; Hankel Matrix; Nuclear Norm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bardakci, I. E. (2014). Approximate Realization of Hidden Markov Models. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/23697

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

Bardakci, Ibrahim Ekrem. “Approximate Realization of Hidden Markov Models.” 2014. Masters Thesis, Penn State University. Accessed December 10, 2019. https://etda.libraries.psu.edu/catalog/23697.

MLA Handbook (7^{th} Edition):

Bardakci, Ibrahim Ekrem. “Approximate Realization of Hidden Markov Models.” 2014. Web. 10 Dec 2019.

Vancouver:

Bardakci IE. Approximate Realization of Hidden Markov Models. [Internet] [Masters thesis]. Penn State University; 2014. [cited 2019 Dec 10]. Available from: https://etda.libraries.psu.edu/catalog/23697.

Council of Science Editors:

Bardakci IE. Approximate Realization of Hidden Markov Models. [Masters Thesis]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/23697

University of Waterloo

3. Ames, Brendan. Convex relaxation for the planted clique, biclique, and clustering problems.

Degree: 2011, University of Waterloo

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

► A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique (U, V ) of a bipartite graph…
(more)

Subjects/Keywords: nuclear norm minimization; convex optimization; maximum clique; clustering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ames, B. (2011). Convex relaxation for the planted clique, biclique, and clustering problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6113

Not specified: Masters Thesis or Doctoral Dissertation

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

Ames, Brendan. “Convex relaxation for the planted clique, biclique, and clustering problems.” 2011. Thesis, University of Waterloo. Accessed December 10, 2019. http://hdl.handle.net/10012/6113.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ames, Brendan. “Convex relaxation for the planted clique, biclique, and clustering problems.” 2011. Web. 10 Dec 2019.

Vancouver:

Ames B. Convex relaxation for the planted clique, biclique, and clustering problems. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/10012/6113.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ames B. Convex relaxation for the planted clique, biclique, and clustering problems. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6113

Not specified: Masters Thesis or Doctoral Dissertation

4. ミヤ リズキニヤ. Study on Denoising and Unmixing of Hyperspectral Images Exploiting Spectral Linearity : スペクトルの線形性を考慮したハイパースペクトラル画像のノイズ除去とアンミキシングに関する研究.

Degree: 博士, 2018, The University of Kitakyushu / 北九州市立大学

URL: http://id.nii.ac.jp/1077/00000567/

► This study aims to generalize color line to M-dimensional spectral line feature (M>3) and introduce methods for denoising and unmixing of hyperspectral images based on…
(more)

Subjects/Keywords: color line; spectral linearity; hyperspectral image; nuclear norm; denoising; unmixing; local spectral component decomposition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

ミヤ リズキニヤ. (2018). Study on Denoising and Unmixing of Hyperspectral Images Exploiting Spectral Linearity : スペクトルの線形性を考慮したハイパースペクトラル画像のノイズ除去とアンミキシングに関する研究. (Thesis). The University of Kitakyushu / 北九州市立大学. Retrieved from http://id.nii.ac.jp/1077/00000567/

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

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

ミヤ リズキニヤ. “Study on Denoising and Unmixing of Hyperspectral Images Exploiting Spectral Linearity : スペクトルの線形性を考慮したハイパースペクトラル画像のノイズ除去とアンミキシングに関する研究.” 2018. Thesis, The University of Kitakyushu / 北九州市立大学. Accessed December 10, 2019. http://id.nii.ac.jp/1077/00000567/.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

ミヤ リズキニヤ. “Study on Denoising and Unmixing of Hyperspectral Images Exploiting Spectral Linearity : スペクトルの線形性を考慮したハイパースペクトラル画像のノイズ除去とアンミキシングに関する研究.” 2018. Web. 10 Dec 2019.

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

Author name may be incomplete

Vancouver:

ミヤ リズキニヤ. Study on Denoising and Unmixing of Hyperspectral Images Exploiting Spectral Linearity : スペクトルの線形性を考慮したハイパースペクトラル画像のノイズ除去とアンミキシングに関する研究. [Internet] [Thesis]. The University of Kitakyushu / 北九州市立大学; 2018. [cited 2019 Dec 10]. Available from: http://id.nii.ac.jp/1077/00000567/.

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

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ミヤ リズキニヤ. Study on Denoising and Unmixing of Hyperspectral Images Exploiting Spectral Linearity : スペクトルの線形性を考慮したハイパースペクトラル画像のノイズ除去とアンミキシングに関する研究. [Thesis]. The University of Kitakyushu / 北九州市立大学; 2018. Available from: http://id.nii.ac.jp/1077/00000567/

Author name may be incomplete

Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

5. Zhou, Fan. Statistical inference for high dimensional data with low rank structure.

Degree: PhD, Mathematics, 2018, Georgia Tech

URL: http://hdl.handle.net/1853/60750

► We study two major topics on statistical inference for high dimensional data with low rank structure occurred in many machine learning and statistics applications. The…
(more)

Subjects/Keywords: Nonparametric statistics; Matrix completion; Low rank; Nuclear norm; Tensor; Singular vector perturbation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhou, F. (2018). Statistical inference for high dimensional data with low rank structure. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60750

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

Zhou, Fan. “Statistical inference for high dimensional data with low rank structure.” 2018. Doctoral Dissertation, Georgia Tech. Accessed December 10, 2019. http://hdl.handle.net/1853/60750.

MLA Handbook (7^{th} Edition):

Zhou, Fan. “Statistical inference for high dimensional data with low rank structure.” 2018. Web. 10 Dec 2019.

Vancouver:

Zhou F. Statistical inference for high dimensional data with low rank structure. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/1853/60750.

Council of Science Editors:

Zhou F. Statistical inference for high dimensional data with low rank structure. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60750

University of Minnesota

6.
Deshmane, Harshad.
System identification via *Nuclear* *norm* regularization.

Degree: MS, Electrical Engineering, 2014, University of Minnesota

URL: http://hdl.handle.net/11299/165456

► We study the subspace method for system identification, and look at algorithms that rely on *nuclear* *norm* regularization for solving this problem. We introduce our…
(more)

Subjects/Keywords: Alternating direction method of multipliers; Hankel operator; Line search methods; Nuclear norm optimization; Subspace methods; System identification

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Deshmane, H. (2014). System identification via Nuclear norm regularization. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/165456

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

Deshmane, Harshad. “System identification via Nuclear norm regularization.” 2014. Masters Thesis, University of Minnesota. Accessed December 10, 2019. http://hdl.handle.net/11299/165456.

MLA Handbook (7^{th} Edition):

Deshmane, Harshad. “System identification via Nuclear norm regularization.” 2014. Web. 10 Dec 2019.

Vancouver:

Deshmane H. System identification via Nuclear norm regularization. [Internet] [Masters thesis]. University of Minnesota; 2014. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/11299/165456.

Council of Science Editors:

Deshmane H. System identification via Nuclear norm regularization. [Masters Thesis]. University of Minnesota; 2014. Available from: http://hdl.handle.net/11299/165456

University of Illinois – Urbana-Champaign

7. Thekumparampil, Kiran Koshy. Collaborative ranking from ordinal data.

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

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

► Personalized recommendation systems have to predict preferences of a user for items that have not seen by the user. For cardinal (ratings) data, personalized preference…
(more)

Subjects/Keywords: Collaborative ranking; Recommendation system; Revenue management; Ordinal (comparison) data; Multinomial logit (MNL) model; Convex relaxation; Nuclear norm minimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Thekumparampil, K. K. (2017). Collaborative ranking from ordinal data. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97794

Not specified: Masters Thesis or Doctoral Dissertation

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

Thekumparampil, Kiran Koshy. “Collaborative ranking from ordinal data.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed December 10, 2019. http://hdl.handle.net/2142/97794.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Thekumparampil, Kiran Koshy. “Collaborative ranking from ordinal data.” 2017. Web. 10 Dec 2019.

Vancouver:

Thekumparampil KK. Collaborative ranking from ordinal data. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/2142/97794.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Thekumparampil KK. Collaborative ranking from ordinal data. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97794

Not specified: Masters Thesis or Doctoral Dissertation

8. Pierucci, Federico. Optimisation non-lisse pour l'apprentissage statistique avec régularisation matricielle structurée : Nonsmooth optimization for statistical learning with structured matrix regularization.

Degree: Docteur es, Mathématiques et Informatique, 2017, Grenoble Alpes

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

► La phase d’apprentissage des méthodes d’apprentissage statistique automatique correspondent à la résolution d’un problème d’optimisation mathématique dont la fonction objectif se décompose en deux parties:…
(more)

Subjects/Keywords: Méthodes de gradient; Frank-Wolfe; Gradient conditionnel; Lissage; Norme nucléaire; First-Order optimization; Conditional gradient; Frank-Wolfe; Smoothing; Nuclear-Norm; 004; 510

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Pierucci, F. (2017). Optimisation non-lisse pour l'apprentissage statistique avec régularisation matricielle structurée : Nonsmooth optimization for statistical learning with structured matrix regularization. (Doctoral Dissertation). Grenoble Alpes. Retrieved from http://www.theses.fr/2017GREAM024

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

Pierucci, Federico. “Optimisation non-lisse pour l'apprentissage statistique avec régularisation matricielle structurée : Nonsmooth optimization for statistical learning with structured matrix regularization.” 2017. Doctoral Dissertation, Grenoble Alpes. Accessed December 10, 2019. http://www.theses.fr/2017GREAM024.

MLA Handbook (7^{th} Edition):

Pierucci, Federico. “Optimisation non-lisse pour l'apprentissage statistique avec régularisation matricielle structurée : Nonsmooth optimization for statistical learning with structured matrix regularization.” 2017. Web. 10 Dec 2019.

Vancouver:

Pierucci F. Optimisation non-lisse pour l'apprentissage statistique avec régularisation matricielle structurée : Nonsmooth optimization for statistical learning with structured matrix regularization. [Internet] [Doctoral dissertation]. Grenoble Alpes; 2017. [cited 2019 Dec 10]. Available from: http://www.theses.fr/2017GREAM024.

Council of Science Editors:

Pierucci F. Optimisation non-lisse pour l'apprentissage statistique avec régularisation matricielle structurée : Nonsmooth optimization for statistical learning with structured matrix regularization. [Doctoral Dissertation]. Grenoble Alpes; 2017. Available from: http://www.theses.fr/2017GREAM024

9. MIAO WEIMIN. Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints.

Degree: 2013, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/37889

Subjects/Keywords: matrix completion; rank minimization; low rank; error bound; rank consistency; semi-nuclear norm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

WEIMIN, M. (2013). Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/37889

Not specified: Masters Thesis or Doctoral Dissertation

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

WEIMIN, MIAO. “Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints.” 2013. Thesis, National University of Singapore. Accessed December 10, 2019. http://scholarbank.nus.edu.sg/handle/10635/37889.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

WEIMIN, MIAO. “Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints.” 2013. Web. 10 Dec 2019.

Vancouver:

WEIMIN M. Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints. [Internet] [Thesis]. National University of Singapore; 2013. [cited 2019 Dec 10]. Available from: http://scholarbank.nus.edu.sg/handle/10635/37889.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

WEIMIN M. Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints. [Thesis]. National University of Singapore; 2013. Available from: http://scholarbank.nus.edu.sg/handle/10635/37889

Not specified: Masters Thesis or Doctoral Dissertation

10. Zhang, Anru. High-dimensional Statistical Inference: from Vector to Matrix.

Degree: 2015, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/1172

► Statistical inference for sparse signals or low-rank matrices in high-dimensional settings is of significant interest in a range of contemporary applications. It has attracted significant…
(more)

Subjects/Keywords: Constrained l_1 minimization; Constrained nuclear norm minimization; Genomic data integration; Low-rank matrix recovery; Optimal rate of convergence; Sparse signal recovery; Applied Mathematics; Statistics and Probability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, A. (2015). High-dimensional Statistical Inference: from Vector to Matrix. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/1172

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Anru. “High-dimensional Statistical Inference: from Vector to Matrix.” 2015. Thesis, University of Pennsylvania. Accessed December 10, 2019. https://repository.upenn.edu/edissertations/1172.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Anru. “High-dimensional Statistical Inference: from Vector to Matrix.” 2015. Web. 10 Dec 2019.

Vancouver:

Zhang A. High-dimensional Statistical Inference: from Vector to Matrix. [Internet] [Thesis]. University of Pennsylvania; 2015. [cited 2019 Dec 10]. Available from: https://repository.upenn.edu/edissertations/1172.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang A. High-dimensional Statistical Inference: from Vector to Matrix. [Thesis]. University of Pennsylvania; 2015. Available from: https://repository.upenn.edu/edissertations/1172

Not specified: Masters Thesis or Doctoral Dissertation

11.
JIANG KAIFENG.
Algorithms for Large Scale *Nuclear* *Norm* Minimization and Convex Quadratic Semidefinite Programming Problems.

Degree: 2011, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/30701

Subjects/Keywords: Nuclear norm minimization; convex quadratic semidefinite programming; partial proximal point algorithm; inexact smoothing Newton method; inexact APG

Record Details Similar Records

❌

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

APA (6^{th} Edition):

KAIFENG, J. (2011). Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/30701

Not specified: Masters Thesis or Doctoral Dissertation

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

KAIFENG, JIANG. “Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems.” 2011. Thesis, National University of Singapore. Accessed December 10, 2019. http://scholarbank.nus.edu.sg/handle/10635/30701.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

KAIFENG, JIANG. “Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems.” 2011. Web. 10 Dec 2019.

Vancouver:

KAIFENG J. Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems. [Internet] [Thesis]. National University of Singapore; 2011. [cited 2019 Dec 10]. Available from: http://scholarbank.nus.edu.sg/handle/10635/30701.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

KAIFENG J. Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems. [Thesis]. National University of Singapore; 2011. Available from: http://scholarbank.nus.edu.sg/handle/10635/30701

Not specified: Masters Thesis or Doctoral Dissertation

University of Central Florida

12. Oreifej, Omar. Robust Subspace Estimation Using Low-rank Optimization. Theory And Applications In Scene Reconstruction, Video Denoising, And Activity Recognition.

Degree: 2013, University of Central Florida

URL: https://stars.library.ucf.edu/etd/2569

► In this dissertation, we discuss the problem of robust linear subspace estimation using low-rank optimization and propose three formulations of it. We demonstrate how these…
(more)

Subjects/Keywords: low rank representation; low rank; sparse representation; sparse; activity recognition; turbulence mitigation; video denoising; complex event recognition; nuclear norm; augmented lagrange multiplier; camera motion estimation; trecvid; hoha; water waves; rank; trajectories; particle advection; registration; decomposition; moving object detection; background subtraction; atmospheric turbulence; Computer Engineering; Engineering; Dissertations, Academic – Engineering and Computer Science, Engineering and Computer Science – Dissertations, Academic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Oreifej, O. (2013). Robust Subspace Estimation Using Low-rank Optimization. Theory And Applications In Scene Reconstruction, Video Denoising, And Activity Recognition. (Doctoral Dissertation). University of Central Florida. Retrieved from https://stars.library.ucf.edu/etd/2569

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

Oreifej, Omar. “Robust Subspace Estimation Using Low-rank Optimization. Theory And Applications In Scene Reconstruction, Video Denoising, And Activity Recognition.” 2013. Doctoral Dissertation, University of Central Florida. Accessed December 10, 2019. https://stars.library.ucf.edu/etd/2569.

MLA Handbook (7^{th} Edition):

Oreifej, Omar. “Robust Subspace Estimation Using Low-rank Optimization. Theory And Applications In Scene Reconstruction, Video Denoising, And Activity Recognition.” 2013. Web. 10 Dec 2019.

Vancouver:

Oreifej O. Robust Subspace Estimation Using Low-rank Optimization. Theory And Applications In Scene Reconstruction, Video Denoising, And Activity Recognition. [Internet] [Doctoral dissertation]. University of Central Florida; 2013. [cited 2019 Dec 10]. Available from: https://stars.library.ucf.edu/etd/2569.

Council of Science Editors:

Oreifej O. Robust Subspace Estimation Using Low-rank Optimization. Theory And Applications In Scene Reconstruction, Video Denoising, And Activity Recognition. [Doctoral Dissertation]. University of Central Florida; 2013. Available from: https://stars.library.ucf.edu/etd/2569

13. Hulth, Maria. Det osynliga regnbågsbarnet på förskolan : En enkätundersökning om normer, olikheter och särskiljandets betydelse.

Degree: Culture and History, 2006, Södertörn University College

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-506

►

The purpose of this paper is to see how differences are handled in preschools, with a focus on children with homo- or bisexual parents.… (more)

Subjects/Keywords: children with homosexual parents; preschool; differences; distinction; norms; the heterosexual norm; heterosexism; rainbow child; nuclear family; barn med homosexuella föräldrar; förskola; olikhet; särskiljande; normer; den heterosexuella normen; heterosexism; regnbågsbarn; kärnfamilj; Gender studies; Genus

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hulth, M. (2006). Det osynliga regnbågsbarnet på förskolan : En enkätundersökning om normer, olikheter och särskiljandets betydelse. (Thesis). Södertörn University College. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-506

Not specified: Masters Thesis or Doctoral Dissertation

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

Hulth, Maria. “Det osynliga regnbågsbarnet på förskolan : En enkätundersökning om normer, olikheter och särskiljandets betydelse.” 2006. Thesis, Södertörn University College. Accessed December 10, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-506.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hulth, Maria. “Det osynliga regnbågsbarnet på förskolan : En enkätundersökning om normer, olikheter och särskiljandets betydelse.” 2006. Web. 10 Dec 2019.

Vancouver:

Hulth M. Det osynliga regnbågsbarnet på förskolan : En enkätundersökning om normer, olikheter och särskiljandets betydelse. [Internet] [Thesis]. Södertörn University College; 2006. [cited 2019 Dec 10]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-506.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hulth M. Det osynliga regnbågsbarnet på förskolan : En enkätundersökning om normer, olikheter och särskiljandets betydelse. [Thesis]. Södertörn University College; 2006. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-506

Not specified: Masters Thesis or Doctoral Dissertation

14. Xiao, Jing. Tracking-by-selection pose estimation in videos.

Degree: MS, Department of Electrical and Computer Engineering, 2016, Northeastern University

URL: http://hdl.handle.net/2047/D20213260

► In this thesis, we propose a novel, effective, yet simple tracking-by-selection algorithm for human pose estimation in videos. The problem is solved by two steps,…
(more)

Subjects/Keywords: dynamics; Hankel matrix; nuclear norm; pose estimations; videos; Computer vision; Pattern recognition systems; Image processing; Digital techniques; Matrices; Algorithms; Human mechanics

…the least *Nuclear*
*norm* of its Hankel matrix among all the possible combinations. In the end… …systems, auto regression, Hankel matrix
and *Nuclear* *norm*.
Chapter 3, presents a *Nuclear* *norm* of… …and *Nuclear* *Norm*
From section 2.2, we know the fact that the order of the system is the rank… …relates to rank is *Nuclear* *norm*, who often substitute the positions of rank in rank
minimization… …problems. *Nuclear* *norm* is equivalent to the l1 -*norm* of the vector of its eigenvalues.
Thus, when…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xiao, J. (2016). Tracking-by-selection pose estimation in videos. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20213260

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

Xiao, Jing. “Tracking-by-selection pose estimation in videos.” 2016. Masters Thesis, Northeastern University. Accessed December 10, 2019. http://hdl.handle.net/2047/D20213260.

MLA Handbook (7^{th} Edition):

Xiao, Jing. “Tracking-by-selection pose estimation in videos.” 2016. Web. 10 Dec 2019.

Vancouver:

Xiao J. Tracking-by-selection pose estimation in videos. [Internet] [Masters thesis]. Northeastern University; 2016. [cited 2019 Dec 10]. Available from: http://hdl.handle.net/2047/D20213260.

Council of Science Editors:

Xiao J. Tracking-by-selection pose estimation in videos. [Masters Thesis]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20213260