Advanced search options

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

University: University of Waterloo ^{❌}

You searched for `subject:(lattice concept algorithm Jester Movielens)`

.
Showing records 1 – 30 of
128 total matches.

Search Limiters

Dates

- 2015 – 2019 (45)
- 2010 – 2014 (36)
- 2005 – 2009 (33)
- 2000 – 2004 (18)

▼ Search Limiters

University of Waterloo

1.
Taherzadeh, Mahmoud.
* Lattice*-Based Precoding And Decoding in MIMO Fading Systems.

Degree: 2008, University of Waterloo

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

► In this thesis, different aspects of *lattice*-based precoding and decoding for the transmission of digital and analog data over MIMO fading channels are investigated: 1)…
(more)

Subjects/Keywords: Lattice decoding; Precoding; MIMO communications; Fading channels; Joint source-channel coding; Lattice-basis reduction; LLL algorithm; Diversity-multiplexing trade-off; Diversity-fidelity trade-off

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Taherzadeh, M. (2008). Lattice-Based Precoding And Decoding in MIMO Fading Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3622

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

Taherzadeh, Mahmoud. “Lattice-Based Precoding And Decoding in MIMO Fading Systems.” 2008. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/3622.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Taherzadeh, Mahmoud. “Lattice-Based Precoding And Decoding in MIMO Fading Systems.” 2008. Web. 17 Jun 2019.

Vancouver:

Taherzadeh M. Lattice-Based Precoding And Decoding in MIMO Fading Systems. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/3622.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Taherzadeh M. Lattice-Based Precoding And Decoding in MIMO Fading Systems. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3622

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

2. Liu, Guoxiang. Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models.

Degree: 2010, University of Waterloo

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

► The shallow subsurface controls the partitioning of available energy between sensible and latent heat of the land surface, and the partitioning of available water among…
(more)

Subjects/Keywords: infiltration algorithm; interflow algorithm; distributed hydrological models

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, G. (2010). Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5519

Not specified: Masters Thesis or Doctoral Dissertation

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

Liu, Guoxiang. “Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models.” 2010. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/5519.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Guoxiang. “Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models.” 2010. Web. 17 Jun 2019.

Vancouver:

Liu G. Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/5519.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu G. Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5519

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

3.
Mahajan, Shikha.
A Faster *Algorithm* for Recognizing Edge-Weighted Interval Graphs.

Degree: 2017, University of Waterloo

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

► Interval graphs—the intersection graphs of one-dimensional intervals—are considered one of the most useful mathematical structures to model real life applications. Interval graphs have been widely…
(more)

Subjects/Keywords: Interval Graphs; Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mahajan, S. (2017). A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11765

Not specified: Masters Thesis or Doctoral Dissertation

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

Mahajan, Shikha. “A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs.” 2017. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/11765.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mahajan, Shikha. “A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs.” 2017. Web. 17 Jun 2019.

Vancouver:

Mahajan S. A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/11765.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mahajan S. A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11765

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

4. Li, Boyu. Regular Dilation on Semigroups.

Degree: 2018, University of Waterloo

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

► Dilation theory originated from Sz.Nagy's celebrated dilation theorem which states that every contractive operator has an isometric dilation. Regular dilation is one of many fruitful…
(more)

Subjects/Keywords: Nica-covariance; Semigroups; Dilation; Lattice order

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, B. (2018). Regular Dilation on Semigroups. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13541

Not specified: Masters Thesis or Doctoral Dissertation

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

Li, Boyu. “Regular Dilation on Semigroups.” 2018. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/13541.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Boyu. “Regular Dilation on Semigroups.” 2018. Web. 17 Jun 2019.

Vancouver:

Li B. Regular Dilation on Semigroups. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/13541.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li B. Regular Dilation on Semigroups. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13541

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

5. Fawcett, Joanna. The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability.

Degree: 2009, University of Waterloo

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

► The O'Nan-Scott Theorem classifies finite primitive permutation groups into one of five isomorphism classes. This theorem is very useful for answering questions about finite permutation…
(more)

Subjects/Keywords: group theory; permutation group; primitive; lattice

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fawcett, J. (2009). The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4534

Not specified: Masters Thesis or Doctoral Dissertation

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

Fawcett, Joanna. “The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability.” 2009. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/4534.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fawcett, Joanna. “The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability.” 2009. Web. 17 Jun 2019.

Vancouver:

Fawcett J. The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/4534.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fawcett J. The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4534

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

6.
Danesh Jafari, Mohammad Erfan.
Adaptive *Lattice* Reduction in MIMO Systems.

Degree: 2008, University of Waterloo

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

► In multiple-input multiple-output (MIMO) systems, the use of *lattice* reduction methods such as the one proposed by Lenstra-Lenstra-Lovasz (LLL) significantly improves the performance of the…
(more)

Subjects/Keywords: Lattice Reduction; MIMO

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Danesh Jafari, M. E. (2008). Adaptive Lattice Reduction in MIMO Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3728

Not specified: Masters Thesis or Doctoral Dissertation

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

Danesh Jafari, Mohammad Erfan. “Adaptive Lattice Reduction in MIMO Systems.” 2008. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/3728.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Danesh Jafari, Mohammad Erfan. “Adaptive Lattice Reduction in MIMO Systems.” 2008. Web. 17 Jun 2019.

Vancouver:

Danesh Jafari ME. Adaptive Lattice Reduction in MIMO Systems. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/3728.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Danesh Jafari ME. Adaptive Lattice Reduction in MIMO Systems. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3728

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

7. Sinnamon, Corwin. Efficient Representation and Encoding of Distributive Lattices.

Degree: 2018, University of Waterloo

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

► This thesis presents two new representations of distributive lattices with an eye towards efficiency in both time and space. Distributive lattices are a well-known class…
(more)

Subjects/Keywords: succinct data structure; compact data structure; lattice; distributive lattice; partially-ordered set; persistence

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sinnamon, C. (2018). Efficient Representation and Encoding of Distributive Lattices. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13609

Not specified: Masters Thesis or Doctoral Dissertation

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

Sinnamon, Corwin. “Efficient Representation and Encoding of Distributive Lattices.” 2018. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/13609.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sinnamon, Corwin. “Efficient Representation and Encoding of Distributive Lattices.” 2018. Web. 17 Jun 2019.

Vancouver:

Sinnamon C. Efficient Representation and Encoding of Distributive Lattices. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/13609.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sinnamon C. Efficient Representation and Encoding of Distributive Lattices. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13609

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

8. Jain, Kshitij. Minimum Shared-Power Edge Cut.

Degree: 2018, University of Waterloo

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

► We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s…
(more)

Subjects/Keywords: Algorithms; Computational Geometry; Approximation Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jain, K. (2018). Minimum Shared-Power Edge Cut. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13664

Not specified: Masters Thesis or Doctoral Dissertation

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

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/13664.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Web. 17 Jun 2019.

Vancouver:

Jain K. Minimum Shared-Power Edge Cut. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/13664.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jain K. Minimum Shared-Power Edge Cut. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13664

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

9.
Phan, Tuan.
Evaluating the Usability of a Medication Organizing Tool on Home Medication Management - A Proof-of-*Concept* Experiment.

Degree: 2015, University of Waterloo

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

► Background: Chronic disease and medication self-management is a life-long process in which patient self-efficacy plays an important role in determining success. Efforts to improve self-management…
(more)

Subjects/Keywords: Usability; Medication; Management; Proof of concept; Tool

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Phan, T. (2015). Evaluating the Usability of a Medication Organizing Tool on Home Medication Management - A Proof-of-Concept Experiment. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9191

Not specified: Masters Thesis or Doctoral Dissertation

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

Phan, Tuan. “Evaluating the Usability of a Medication Organizing Tool on Home Medication Management - A Proof-of-Concept Experiment.” 2015. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/9191.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Phan, Tuan. “Evaluating the Usability of a Medication Organizing Tool on Home Medication Management - A Proof-of-Concept Experiment.” 2015. Web. 17 Jun 2019.

Vancouver:

Phan T. Evaluating the Usability of a Medication Organizing Tool on Home Medication Management - A Proof-of-Concept Experiment. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/9191.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Phan T. Evaluating the Usability of a Medication Organizing Tool on Home Medication Management - A Proof-of-Concept Experiment. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9191

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

10.
Li, Chao.
* Lattice* Compression of Polynomial Matrices.

Degree: 2007, University of Waterloo

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

► This thesis investigates *lattice* compression of polynomial matrices over finite fields. For an m x n matrix, the goal of *lattice* compression is to find…
(more)

Subjects/Keywords: Polynomial matrices; Lattice compression; Randomize

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, C. (2007). Lattice Compression of Polynomial Matrices. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2778

Not specified: Masters Thesis or Doctoral Dissertation

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

Li, Chao. “Lattice Compression of Polynomial Matrices.” 2007. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/2778.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Chao. “Lattice Compression of Polynomial Matrices.” 2007. Web. 17 Jun 2019.

Vancouver:

Li C. Lattice Compression of Polynomial Matrices. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/2778.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li C. Lattice Compression of Polynomial Matrices. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2778

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

11. Hnybida, Jeff. Generating Functionals for Spin Foam Amplitudes.

Degree: 2014, University of Waterloo

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

► Various approaches to Quantum Gravity such as Loop Quantum Gravity, Spin Foam Models and Tensor-Group Field theories use invariant tensors on a group, called intertwiners,…
(more)

Subjects/Keywords: Quantum Gravity; Lattice Gauge Theory; Topological Field Theory; SU(2) Recoupling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hnybida, J. (2014). Generating Functionals for Spin Foam Amplitudes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8861

Not specified: Masters Thesis or Doctoral Dissertation

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

Hnybida, Jeff. “Generating Functionals for Spin Foam Amplitudes.” 2014. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/8861.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hnybida, Jeff. “Generating Functionals for Spin Foam Amplitudes.” 2014. Web. 17 Jun 2019.

Vancouver:

Hnybida J. Generating Functionals for Spin Foam Amplitudes. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/8861.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hnybida J. Generating Functionals for Spin Foam Amplitudes. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8861

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

12. Koh, Zhuan Khye. Stabilizing Weighted Graphs.

Degree: 2017, University of Waterloo

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

► An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable…
(more)

Subjects/Keywords: Matching; Game Theory; Network Bargaining; Approximation Algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Koh, Z. K. (2017). Stabilizing Weighted Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12246

Not specified: Masters Thesis or Doctoral Dissertation

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

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/12246.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Web. 17 Jun 2019.

Vancouver:

Koh ZK. Stabilizing Weighted Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/12246.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koh ZK. Stabilizing Weighted Graphs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12246

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

13. Jiang, Wenzhe. Construction of Optimal Tubular Networks in Arbitrary Regions in R^3.

Degree: 2015, University of Waterloo

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

► In this thesis, we describe various algorithms for the construction of tubular networks in an arbitrary three-dimensional region that possesses a principal direction along which…
(more)

Subjects/Keywords: Tubular network; Circle packing; Matching; Genetic algorithm

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jiang, W. (2015). Construction of Optimal Tubular Networks in Arbitrary Regions in R^3. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9510

Not specified: Masters Thesis or Doctoral Dissertation

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

Jiang, Wenzhe. “Construction of Optimal Tubular Networks in Arbitrary Regions in R^3.” 2015. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/9510.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jiang, Wenzhe. “Construction of Optimal Tubular Networks in Arbitrary Regions in R^3.” 2015. Web. 17 Jun 2019.

Vancouver:

Jiang W. Construction of Optimal Tubular Networks in Arbitrary Regions in R^3. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/9510.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jiang W. Construction of Optimal Tubular Networks in Arbitrary Regions in R^3. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9510

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

14. Tilak, Hrushikesh. Computing sparse multiples of polynomials.

Degree: 2010, University of Waterloo

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

► We consider the problem of finding a sparse multiple of a polynomial. Given a polynomial f ∈ F[x] of degree d over a field F,…
(more)

Subjects/Keywords: complexity; polynomial; sparse; multiple; algorithm; lowerbound

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tilak, H. (2010). Computing sparse multiples of polynomials. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5455

Not specified: Masters Thesis or Doctoral Dissertation

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

Tilak, Hrushikesh. “Computing sparse multiples of polynomials.” 2010. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/5455.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tilak, Hrushikesh. “Computing sparse multiples of polynomials.” 2010. Web. 17 Jun 2019.

Vancouver:

Tilak H. Computing sparse multiples of polynomials. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/5455.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tilak H. Computing sparse multiples of polynomials. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5455

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

15. Truszkowski, Jakub. Fast Algorithms for Large-Scale Phylogenetic Reconstruction.

Degree: 2013, University of Waterloo

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

► One of the most fundamental computational problems in biology is that of inferring evolutionary histories of groups of species from sequence data. Such evolutionary histories,…
(more)

Subjects/Keywords: phylogeny; randomized algorithm; quartet; Markov chain

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Truszkowski, J. (2013). Fast Algorithms for Large-Scale Phylogenetic Reconstruction. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8011

Not specified: Masters Thesis or Doctoral Dissertation

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

Truszkowski, Jakub. “Fast Algorithms for Large-Scale Phylogenetic Reconstruction.” 2013. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/8011.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Truszkowski, Jakub. “Fast Algorithms for Large-Scale Phylogenetic Reconstruction.” 2013. Web. 17 Jun 2019.

Vancouver:

Truszkowski J. Fast Algorithms for Large-Scale Phylogenetic Reconstruction. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/8011.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Truszkowski J. Fast Algorithms for Large-Scale Phylogenetic Reconstruction. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/8011

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

16. Musleh, Yossef. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.

Degree: 2018, University of Waterloo

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

► This thesis introduces a new Monte Carlo randomized *algorithm* for computing the characteristic polynomial of a rank-2 Drinfeld module. We also introduce a deterministic *algorithm*…
(more)

Subjects/Keywords: Drinfeld; Module; Elliptic; Curve; Cryptography; Algorithm; Randomized

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Musleh, Y. (2018). Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13889

Not specified: Masters Thesis or Doctoral Dissertation

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

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/13889.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Web. 17 Jun 2019.

Vancouver:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/13889.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13889

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

17.
Mobasher, Amin.
Applications of *Lattice* Codes in Communication Systems.

Degree: 2007, University of Waterloo

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

► In the last decade, there has been an explosive growth in different applications of wireless technology, due to users' increasing expectations for multi-media services. With…
(more)

Subjects/Keywords: Lattice Codes; Lattice Decoding; Lattice Labeling; Lattice; OFDM Systems; Multiple Antenna Systems; Broadcast Systems; MIMO Systems; Selective Maping; Semi-Definite Programming; PAPR; Optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mobasher, A. (2007). Applications of Lattice Codes in Communication Systems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3452

Not specified: Masters Thesis or Doctoral Dissertation

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

Mobasher, Amin. “Applications of Lattice Codes in Communication Systems.” 2007. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/3452.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mobasher, Amin. “Applications of Lattice Codes in Communication Systems.” 2007. Web. 17 Jun 2019.

Vancouver:

Mobasher A. Applications of Lattice Codes in Communication Systems. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/3452.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mobasher A. Applications of Lattice Codes in Communication Systems. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3452

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

18. Nasiri, Ali Mohamad. Laser Brazing of Magnesium to Steel Sheet.

Degree: 2013, University of Waterloo

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

► The ability to effectively join magnesium alloys to steel will facilitate increased application and use of Mg alloys in the automotive and aerospace industries where…
(more)

Subjects/Keywords: Laser brazing; AZ31B Mg sheet; Steel sheet; Wetting; Lattice Matching; FactSage; Microstructure; Welding

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nasiri, A. M. (2013). Laser Brazing of Magnesium to Steel Sheet. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8010

Not specified: Masters Thesis or Doctoral Dissertation

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

Nasiri, Ali Mohamad. “Laser Brazing of Magnesium to Steel Sheet.” 2013. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/8010.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nasiri, Ali Mohamad. “Laser Brazing of Magnesium to Steel Sheet.” 2013. Web. 17 Jun 2019.

Vancouver:

Nasiri AM. Laser Brazing of Magnesium to Steel Sheet. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/8010.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nasiri AM. Laser Brazing of Magnesium to Steel Sheet. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/8010

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

19. Henry, Ryan. Efficient Zero-Knowledge Proofs and Applications.

Degree: 2014, University of Waterloo

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

► Zero-knowledge proofs provide a means for a prover to convince a verifier that some claim is true and nothing more. The ability to prove statements…
(more)

Subjects/Keywords: Batch zero-knowledge proofs; efficiency; privacy enhancing technologies; applied cryptography; lattice attacks; cryptanalysis; anonymous blacklisting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Henry, R. (2014). Efficient Zero-Knowledge Proofs and Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8621

Not specified: Masters Thesis or Doctoral Dissertation

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

Henry, Ryan. “Efficient Zero-Knowledge Proofs and Applications.” 2014. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/8621.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Henry, Ryan. “Efficient Zero-Knowledge Proofs and Applications.” 2014. Web. 17 Jun 2019.

Vancouver:

Henry R. Efficient Zero-Knowledge Proofs and Applications. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/8621.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Henry R. Efficient Zero-Knowledge Proofs and Applications. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8621

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

20.
Schanck, John.
Practical *Lattice* Cryptosystems: NTRUEncrypt and NTRUMLS.

Degree: 2015, University of Waterloo

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

► Public key cryptography, as deployed on the internet today, stands on shaky ground. For over twenty years now it has been known that the systems…
(more)

Subjects/Keywords: NTRU; cryptography; lattice cryptography; post-quantum cryptography; digital signatures; public key encryption; cryptanalysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schanck, J. (2015). Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10074

Not specified: Masters Thesis or Doctoral Dissertation

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

Schanck, John. “Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS.” 2015. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/10074.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schanck, John. “Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS.” 2015. Web. 17 Jun 2019.

Vancouver:

Schanck J. Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/10074.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schanck J. Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/10074

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

21.
Melczer, Stephen.
Analytic Combinatorics in Several Variables: Effective Asymptotics and *Lattice* Path Enumeration.

Degree: 2017, University of Waterloo

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

► The field of analytic combinatorics, which studies the asymptotic behaviour of sequences through analytic properties of their generating functions, has led to the development of…
(more)

Subjects/Keywords: Analytic Combinatorics; Enumerative Combinatorics; Singularity Analysis; Computer Algebra; Lattice Paths; Rational Diagonals; Polynomial Systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Melczer, S. (2017). Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12039

Not specified: Masters Thesis or Doctoral Dissertation

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

Melczer, Stephen. “Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration.” 2017. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/12039.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Melczer, Stephen. “Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration.” 2017. Web. 17 Jun 2019.

Vancouver:

Melczer S. Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/12039.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Melczer S. Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12039

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

22.
Abdulkadhim, Ali.
Solid-Particles Deposition Through a Turbulent Impinging Jet Using *Lattice* Boltzmann Method.

Degree: 2018, University of Waterloo

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

► Solid particle distribution on an impingement surface has been simulated utilizing a graphical processing unit (GPU). An in-house computational fluid dynamics (CFD) code has been…
(more)

Subjects/Keywords: CUDA GPU programming; Large Eddy Simulation; Lattice Boltzmann method; Turbulent impinging jet.; Parallel computing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Abdulkadhim, A. (2018). Solid-Particles Deposition Through a Turbulent Impinging Jet Using Lattice Boltzmann Method. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14079

Not specified: Masters Thesis or Doctoral Dissertation

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

Abdulkadhim, Ali. “Solid-Particles Deposition Through a Turbulent Impinging Jet Using Lattice Boltzmann Method.” 2018. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/14079.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Abdulkadhim, Ali. “Solid-Particles Deposition Through a Turbulent Impinging Jet Using Lattice Boltzmann Method.” 2018. Web. 17 Jun 2019.

Vancouver:

Abdulkadhim A. Solid-Particles Deposition Through a Turbulent Impinging Jet Using Lattice Boltzmann Method. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/14079.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Abdulkadhim A. Solid-Particles Deposition Through a Turbulent Impinging Jet Using Lattice Boltzmann Method. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/14079

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

23. Najafi, Hossein. Applications of Lattices over Wireless Channels.

Degree: 2012, University of Waterloo

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

► In wireless networks, reliable communication is a challenging issue due to many attenuation factors such as receiver noise, channel fading, interference and asynchronous delays. *Lattice*…
(more)

Subjects/Keywords: Wireless; Lattice; Fading; MIMO decoding; Interference Alignment; Compute-and-Forward; Soft-output; Lattice Decoding; X network; Degrees of Freedom; Lattice Reduction; Asynchronous Networks; Asynchronous Communications; Matched Filter; Maximum Likelihood; LLL; DILLL; X channel; Adaptive Decoding; Closest Point Search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Najafi, H. (2012). Applications of Lattices over Wireless Channels. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7041

Not specified: Masters Thesis or Doctoral Dissertation

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

Najafi, Hossein. “Applications of Lattices over Wireless Channels.” 2012. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/7041.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Najafi, Hossein. “Applications of Lattices over Wireless Channels.” 2012. Web. 17 Jun 2019.

Vancouver:

Najafi H. Applications of Lattices over Wireless Channels. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/7041.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Najafi H. Applications of Lattices over Wireless Channels. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/7041

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

24. WANG, ZHEXUAN. Application of Textual Feature Extraction to Corporate Bankruptcy Risk Assessment.

Degree: 2017, University of Waterloo

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

► The inception of the Internet in the late twentieth century has established the ability to generate a huge volume of data from multitudinous sources in…
(more)

Subjects/Keywords: text mining; finance; bankruptcy; prediction; textual feature extraction; concept-based

Record Details Similar Records

❌

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

APA (6^{th} Edition):

WANG, Z. (2017). Application of Textual Feature Extraction to Corporate Bankruptcy Risk Assessment. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12416

Not specified: Masters Thesis or Doctoral Dissertation

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

WANG, ZHEXUAN. “Application of Textual Feature Extraction to Corporate Bankruptcy Risk Assessment.” 2017. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/12416.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

WANG, ZHEXUAN. “Application of Textual Feature Extraction to Corporate Bankruptcy Risk Assessment.” 2017. Web. 17 Jun 2019.

Vancouver:

WANG Z. Application of Textual Feature Extraction to Corporate Bankruptcy Risk Assessment. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/12416.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

WANG Z. Application of Textual Feature Extraction to Corporate Bankruptcy Risk Assessment. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12416

Not specified: Masters Thesis or Doctoral Dissertation

25. Laekhanukit, Bundit. Approximation Algorithms for (S,T)-Connectivity Problems.

Degree: 2010, University of Waterloo

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

► We study a directed network design problem called the k-(S,T)-connectivity problem; we design and analyze approximation algorithms and give hardness results. For each positive integer…
(more)

Subjects/Keywords: algorithm; approximation algorithm; connectivity; directed graph

…10
2.4
The illustration of the working of our *algorithm* for the standard (S, T )… …2.5
The illustration of the working of our 2-approximation *algorithm* for the standard
(… …2.6
The illustration of the working of our approximation *algorithm* for the relaxed
(S… …3.6
The illustration of the working of the padded-Frank *algorithm*. . . . . . . . . . . . 47… …polynomial-time solvable. However, they did not give a combinatorial *algorithm*. In fact, they…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Laekhanukit, B. (2010). Approximation Algorithms for (S,T)-Connectivity Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5321

Not specified: Masters Thesis or Doctoral Dissertation

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

Laekhanukit, Bundit. “Approximation Algorithms for (S,T)-Connectivity Problems.” 2010. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/5321.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Laekhanukit, Bundit. “Approximation Algorithms for (S,T)-Connectivity Problems.” 2010. Web. 17 Jun 2019.

Vancouver:

Laekhanukit B. Approximation Algorithms for (S,T)-Connectivity Problems. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/5321.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Laekhanukit B. Approximation Algorithms for (S,T)-Connectivity Problems. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5321

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

26. Anthony, Danu Beltara. SOCIAL ACCEPTANCE AND SELF-ESTEEM: TUNING THE SOCIOMETER TO INTERPERSONAL VALUE.

Degree: 2007, University of Waterloo

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

► The author drew on sociometer theory to propose that self-esteem is attuned to traits that garner others’ acceptance, and the traits that garner acceptance depend…
(more)

Subjects/Keywords: self-esteem; self-concept; social acceptance

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Anthony, D. B. (2007). SOCIAL ACCEPTANCE AND SELF-ESTEEM: TUNING THE SOCIOMETER TO INTERPERSONAL VALUE. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3008

Not specified: Masters Thesis or Doctoral Dissertation

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

Anthony, Danu Beltara. “SOCIAL ACCEPTANCE AND SELF-ESTEEM: TUNING THE SOCIOMETER TO INTERPERSONAL VALUE.” 2007. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/3008.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Anthony, Danu Beltara. “SOCIAL ACCEPTANCE AND SELF-ESTEEM: TUNING THE SOCIOMETER TO INTERPERSONAL VALUE.” 2007. Web. 17 Jun 2019.

Vancouver:

Anthony DB. SOCIAL ACCEPTANCE AND SELF-ESTEEM: TUNING THE SOCIOMETER TO INTERPERSONAL VALUE. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/3008.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Anthony DB. SOCIAL ACCEPTANCE AND SELF-ESTEEM: TUNING THE SOCIOMETER TO INTERPERSONAL VALUE. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/3008

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

27.
Heydarnoori, Abbas.
Supporting Framework Use via Automatically Extracted *Concept*-Implementation Templates.

Degree: 2009, University of Waterloo

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

► Object-oriented application frameworks allow the reuse of both software design and code and are one of the most effective reuse technologies available today. Frameworks provide…
(more)

Subjects/Keywords: Object-Oriented Application Frameworks; Framework Comprehension; Dynamic Analysis; Reverse Engineering; Framework Documentation; Concept-Implementation Templates

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Heydarnoori, A. (2009). Supporting Framework Use via Automatically Extracted Concept-Implementation Templates. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4341

Not specified: Masters Thesis or Doctoral Dissertation

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

Heydarnoori, Abbas. “Supporting Framework Use via Automatically Extracted Concept-Implementation Templates.” 2009. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/4341.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Heydarnoori, Abbas. “Supporting Framework Use via Automatically Extracted Concept-Implementation Templates.” 2009. Web. 17 Jun 2019.

Vancouver:

Heydarnoori A. Supporting Framework Use via Automatically Extracted Concept-Implementation Templates. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/4341.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Heydarnoori A. Supporting Framework Use via Automatically Extracted Concept-Implementation Templates. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4341

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

28. Percival, Jennifer. Complementarities in the Implementation of Advanced Manufacturing Technologies.

Degree: 2004, University of Waterloo

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

► Within the last decade, the importance of flexibility and efficiency has increased in the manufacturing sector. The rising level of uncertainty in consumer preferences has…
(more)

Subjects/Keywords: Management; Complementarity; Advanced Manufacturing Technologies; Lattice; Substitutes

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Percival, J. (2004). Complementarities in the Implementation of Advanced Manufacturing Technologies. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/843

Not specified: Masters Thesis or Doctoral Dissertation

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

Percival, Jennifer. “Complementarities in the Implementation of Advanced Manufacturing Technologies.” 2004. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/843.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Percival, Jennifer. “Complementarities in the Implementation of Advanced Manufacturing Technologies.” 2004. Web. 17 Jun 2019.

Vancouver:

Percival J. Complementarities in the Implementation of Advanced Manufacturing Technologies. [Internet] [Thesis]. University of Waterloo; 2004. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/843.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Percival J. Complementarities in the Implementation of Advanced Manufacturing Technologies. [Thesis]. University of Waterloo; 2004. Available from: http://hdl.handle.net/10012/843

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

29. Hinek, M. Jason. On the Security of Some Variants of RSA.

Degree: 2007, University of Waterloo

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

► The RSA cryptosystem, named after its inventors, Rivest, Shamir and Adleman, is the most widely known and widely used public-key cryptosystem in the world today.…
(more)

Subjects/Keywords: Cryptography; Cryptanalysis; Variants of RSA; Lattice Attacks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hinek, M. J. (2007). On the Security of Some Variants of RSA. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2988

Not specified: Masters Thesis or Doctoral Dissertation

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

Hinek, M Jason. “On the Security of Some Variants of RSA.” 2007. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/2988.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hinek, M Jason. “On the Security of Some Variants of RSA.” 2007. Web. 17 Jun 2019.

Vancouver:

Hinek MJ. On the Security of Some Variants of RSA. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/2988.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hinek MJ. On the Security of Some Variants of RSA. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2988

Not specified: Masters Thesis or Doctoral Dissertation

30.
Taniguchi, Yoshihiro.
Dependence concepts and selection criteria for *lattice* rules.

Degree: 2014, University of Waterloo

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

► Lemieux recently proposed a new approach that studies randomized quasi-Monte Carlothrough dependency concepts. By analyzing the dependency structure of a rank-1 *lattice*,Lemieux proposed a copula-based…
(more)

Subjects/Keywords: Quasi-Monte carlo; Variance Reduction; Lattice Rule

…*Lattice* Point Set . . . . . . . . . . . . . . . . . . . . . . . . . . . .
6
2.2.2
Star… …9
2.3
2.3.1
Shifted Korobov *Lattice* . . . . . . . . . . . . . . . . . . . . . . . .
3… …Carlo and Korobov *Lattice* for Bilinear Function . .
37
4.2.1
A close look at the variance… …x29;
Korobov *lattice* . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
10
(… …b)
Shifted Korobov *lattice* . . . . . . . . . . . . . . . . . . . . . . . . . .
10…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Taniguchi, Y. (2014). Dependence concepts and selection criteria for lattice rules. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8205

Not specified: Masters Thesis or Doctoral Dissertation

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

Taniguchi, Yoshihiro. “Dependence concepts and selection criteria for lattice rules.” 2014. Thesis, University of Waterloo. Accessed June 17, 2019. http://hdl.handle.net/10012/8205.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Taniguchi, Yoshihiro. “Dependence concepts and selection criteria for lattice rules.” 2014. Web. 17 Jun 2019.

Vancouver:

Taniguchi Y. Dependence concepts and selection criteria for lattice rules. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10012/8205.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Taniguchi Y. Dependence concepts and selection criteria for lattice rules. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8205

Not specified: Masters Thesis or Doctoral Dissertation