Advanced search options

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

You searched for `subject:(Cardinality)`

.
Showing records 1 – 30 of
56 total matches.

Search Limiters

Dates

- 2015 – 2019 (16)
- 2010 – 2014 (16)
- 2005 – 2009 (13)

▼ Search Limiters

University of Notre Dame

1.
Lori Anne Petersen.
How does the representational status of to-be-counted
objects affect children's understanding of
*cardinality*</h1>.

Degree: PhD, Psychology, 2013, University of Notre Dame

URL: https://curate.nd.edu/show/9w032229p4t

► When counting, the final word used to tag the final item in a set represents the *cardinality*, or total number, of the set. Understanding…
(more)

Subjects/Keywords: cardinality; representational status; early mathematical skills; counting

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Petersen, L. A. (2013). How does the representational status of to-be-counted objects affect children's understanding of cardinality</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/9w032229p4t

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

Petersen, Lori Anne. “How does the representational status of to-be-counted objects affect children's understanding of cardinality</h1>.” 2013. Doctoral Dissertation, University of Notre Dame. Accessed September 22, 2019. https://curate.nd.edu/show/9w032229p4t.

MLA Handbook (7^{th} Edition):

Petersen, Lori Anne. “How does the representational status of to-be-counted objects affect children's understanding of cardinality</h1>.” 2013. Web. 22 Sep 2019.

Vancouver:

Petersen LA. How does the representational status of to-be-counted objects affect children's understanding of cardinality</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2013. [cited 2019 Sep 22]. Available from: https://curate.nd.edu/show/9w032229p4t.

Council of Science Editors:

Petersen LA. How does the representational status of to-be-counted objects affect children's understanding of cardinality</h1>. [Doctoral Dissertation]. University of Notre Dame; 2013. Available from: https://curate.nd.edu/show/9w032229p4t

University of Cincinnati

2. Hadish, Mulugeta. Extended Multidimensional Conceptual Spaces in Document Classification.

Degree: MS, Engineering : Computer Science, 2008, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1227158181

► Content based retrieval, entailing knowledge representation, can be essentially described as assessing the similarity between objects which constitute primitives as their building blocks. This thesis…
(more)

Subjects/Keywords: Computer Science; Conceptual spaces; Document classification; ranking; knowledge representiaton; Fuzzy set; Fuzzy sets cardinality; Fuzzy sets cardinality aggregation document

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hadish, M. (2008). Extended Multidimensional Conceptual Spaces in Document Classification. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1227158181

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

Hadish, Mulugeta. “Extended Multidimensional Conceptual Spaces in Document Classification.” 2008. Masters Thesis, University of Cincinnati. Accessed September 22, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1227158181.

MLA Handbook (7^{th} Edition):

Hadish, Mulugeta. “Extended Multidimensional Conceptual Spaces in Document Classification.” 2008. Web. 22 Sep 2019.

Vancouver:

Hadish M. Extended Multidimensional Conceptual Spaces in Document Classification. [Internet] [Masters thesis]. University of Cincinnati; 2008. [cited 2019 Sep 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1227158181.

Council of Science Editors:

Hadish M. Extended Multidimensional Conceptual Spaces in Document Classification. [Masters Thesis]. University of Cincinnati; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1227158181

Univerzitet u Beogradu

3. Vučković, Bojan M., 1980-. Nove kombinatorne konstrukcije u vezi sa problemima iz hromatske teorije grafova, ekstremalne teorije skupova i teorije Bulovih matrica.

Degree: Matematički fakultet, 2018, Univerzitet u Beogradu

URL: https://fedorabg.bg.ac.rs/fedora/get/o:17784/bdef:Content/get

►

Racunarstvo - Diskretna matematika / Computer science - Discrete mathematics

Disertacija prikazuje originalne rezultate iz narednih podoblasti diskretne matematike: hromatske teorije grafova, ekstremalne teorije skupova… (more)

Subjects/Keywords: graph colorings; Frankl’s conjecture; row space cardinality of Boolean matrices

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vučković, Bojan M., 1. (2018). Nove kombinatorne konstrukcije u vezi sa problemima iz hromatske teorije grafova, ekstremalne teorije skupova i teorije Bulovih matrica. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:17784/bdef:Content/get

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

Vučković, Bojan M., 1980-. “Nove kombinatorne konstrukcije u vezi sa problemima iz hromatske teorije grafova, ekstremalne teorije skupova i teorije Bulovih matrica.” 2018. Thesis, Univerzitet u Beogradu. Accessed September 22, 2019. https://fedorabg.bg.ac.rs/fedora/get/o:17784/bdef:Content/get.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vučković, Bojan M., 1980-. “Nove kombinatorne konstrukcije u vezi sa problemima iz hromatske teorije grafova, ekstremalne teorije skupova i teorije Bulovih matrica.” 2018. Web. 22 Sep 2019.

Vancouver:

Vučković, Bojan M. 1. Nove kombinatorne konstrukcije u vezi sa problemima iz hromatske teorije grafova, ekstremalne teorije skupova i teorije Bulovih matrica. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2019 Sep 22]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:17784/bdef:Content/get.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vučković, Bojan M. 1. Nove kombinatorne konstrukcije u vezi sa problemima iz hromatske teorije grafova, ekstremalne teorije skupova i teorije Bulovih matrica. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:17784/bdef:Content/get

Not specified: Masters Thesis or Doctoral Dissertation

University of Western Ontario

4. Goffin, Celia. Beyond magnitude: Judging ordinality of symbolic number is unrelated to magnitude comparison and independently relates to individual differences in arithmetic.

Degree: 2015, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/2952

► In the field of numerical cognition, ordinality, the sequence of numerals, has received less attention than *cardinality*, the number of items in a set. Therefore…
(more)

Subjects/Keywords: ordinality; cardinality; number comparison; numerical cognition; arithmetic achievement; Psychology

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Goffin, C. (2015). Beyond magnitude: Judging ordinality of symbolic number is unrelated to magnitude comparison and independently relates to individual differences in arithmetic. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/2952

Not specified: Masters Thesis or Doctoral Dissertation

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

Goffin, Celia. “Beyond magnitude: Judging ordinality of symbolic number is unrelated to magnitude comparison and independently relates to individual differences in arithmetic.” 2015. Thesis, University of Western Ontario. Accessed September 22, 2019. https://ir.lib.uwo.ca/etd/2952.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Goffin, Celia. “Beyond magnitude: Judging ordinality of symbolic number is unrelated to magnitude comparison and independently relates to individual differences in arithmetic.” 2015. Web. 22 Sep 2019.

Vancouver:

Goffin C. Beyond magnitude: Judging ordinality of symbolic number is unrelated to magnitude comparison and independently relates to individual differences in arithmetic. [Internet] [Thesis]. University of Western Ontario; 2015. [cited 2019 Sep 22]. Available from: https://ir.lib.uwo.ca/etd/2952.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Goffin C. Beyond magnitude: Judging ordinality of symbolic number is unrelated to magnitude comparison and independently relates to individual differences in arithmetic. [Thesis]. University of Western Ontario; 2015. Available from: https://ir.lib.uwo.ca/etd/2952

Not specified: Masters Thesis or Doctoral Dissertation

University of Georgia

5.
Bernaola Ibarra, Luis Anggelo.
Improving the dual *cardinality* simulation algorithms.

Degree: MS, Computer Science, 2018, University of Georgia

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

► Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an NP-complete/NP-hard problem. Isomorphism algorithms requires bijective functions which can be…
(more)

Subjects/Keywords: Subgraph Isomorphism; Cardinality; Graph Database; Graph Simulation; Pattern matching

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bernaola Ibarra, L. A. (2018). Improving the dual cardinality simulation algorithms. (Masters Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/38281

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

Bernaola Ibarra, Luis Anggelo. “Improving the dual cardinality simulation algorithms.” 2018. Masters Thesis, University of Georgia. Accessed September 22, 2019. http://hdl.handle.net/10724/38281.

MLA Handbook (7^{th} Edition):

Bernaola Ibarra, Luis Anggelo. “Improving the dual cardinality simulation algorithms.” 2018. Web. 22 Sep 2019.

Vancouver:

Bernaola Ibarra LA. Improving the dual cardinality simulation algorithms. [Internet] [Masters thesis]. University of Georgia; 2018. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10724/38281.

Council of Science Editors:

Bernaola Ibarra LA. Improving the dual cardinality simulation algorithms. [Masters Thesis]. University of Georgia; 2018. Available from: http://hdl.handle.net/10724/38281

Virginia Tech

6.
Asathulla, Mudabir Kabir.
A Sparsification Based Algorithm for Maximum-*Cardinality* Bipartite Matching in Planar Graphs.

Degree: MS, Electrical and Computer Engineering, 2017, Virginia Tech

URL: http://hdl.handle.net/10919/88080

► Matching is one of the most fundamental algorithmic graph problems. Many variants of matching problems have been studied on different classes of graphs, the one…
(more)

Subjects/Keywords: matching; maximum cardinality; bipartite; planar graph; planar separators

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Asathulla, M. K. (2017). A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/88080

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

Asathulla, Mudabir Kabir. “A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs.” 2017. Masters Thesis, Virginia Tech. Accessed September 22, 2019. http://hdl.handle.net/10919/88080.

MLA Handbook (7^{th} Edition):

Asathulla, Mudabir Kabir. “A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs.” 2017. Web. 22 Sep 2019.

Vancouver:

Asathulla MK. A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10919/88080.

Council of Science Editors:

Asathulla MK. A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/88080

University of California – Riverside

7.
Absalyamov, Ildar.
Query Processing and *Cardinality* Estimation in Modern Database Systems.

Degree: Computer Science, 2018, University of California – Riverside

URL: http://www.escholarship.org/uc/item/4fp3p64x

► The past decade has witnessed the proliferation of new ways to ingest, store, index, and query data. This explosion was driven by the needs of…
(more)

Subjects/Keywords: Computer science; Analytics; Cardinality Estimation; Database; Query Processing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Absalyamov, I. (2018). Query Processing and Cardinality Estimation in Modern Database Systems. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/4fp3p64x

Not specified: Masters Thesis or Doctoral Dissertation

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

Absalyamov, Ildar. “Query Processing and Cardinality Estimation in Modern Database Systems.” 2018. Thesis, University of California – Riverside. Accessed September 22, 2019. http://www.escholarship.org/uc/item/4fp3p64x.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Absalyamov, Ildar. “Query Processing and Cardinality Estimation in Modern Database Systems.” 2018. Web. 22 Sep 2019.

Vancouver:

Absalyamov I. Query Processing and Cardinality Estimation in Modern Database Systems. [Internet] [Thesis]. University of California – Riverside; 2018. [cited 2019 Sep 22]. Available from: http://www.escholarship.org/uc/item/4fp3p64x.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Absalyamov I. Query Processing and Cardinality Estimation in Modern Database Systems. [Thesis]. University of California – Riverside; 2018. Available from: http://www.escholarship.org/uc/item/4fp3p64x

Not specified: Masters Thesis or Doctoral Dissertation

Northeastern University

8. Kyrgyzov, Olexiy Olexandrovych. Non-redundant tensor decomposition.

Degree: PhD, Department of Electrical and Computer Engineering, 2010, Northeastern University

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

► This dissertation provides an overview and analysis of existing methods of tensor decomposition and describes a non-redundant tensor decomposition in terms of which we define…
(more)

Subjects/Keywords: cardinality; decomposition; matrix; rank; redundancy; tensor; Electrical and Computer Engineering; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kyrgyzov, O. O. (2010). Non-redundant tensor decomposition. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/d20002056

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

Kyrgyzov, Olexiy Olexandrovych. “Non-redundant tensor decomposition.” 2010. Doctoral Dissertation, Northeastern University. Accessed September 22, 2019. http://hdl.handle.net/2047/d20002056.

MLA Handbook (7^{th} Edition):

Kyrgyzov, Olexiy Olexandrovych. “Non-redundant tensor decomposition.” 2010. Web. 22 Sep 2019.

Vancouver:

Kyrgyzov OO. Non-redundant tensor decomposition. [Internet] [Doctoral dissertation]. Northeastern University; 2010. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2047/d20002056.

Council of Science Editors:

Kyrgyzov OO. Non-redundant tensor decomposition. [Doctoral Dissertation]. Northeastern University; 2010. Available from: http://hdl.handle.net/2047/d20002056

9. Kandyba-Chimani, Maria. Exact algorithms for network design problems using graph orientations.

Degree: 2011, Technische Universität Dortmund

URL: http://hdl.handle.net/2003/27701

► Gegenstand dieser Dissertation sind exakte Lösungsverfahren für topologische Netzwerkdesignprobleme. Diese kombinatorischen Optimierungsprobleme tauchen in unterschiedlichen realen Anwendungen auf, wie z.B. in der Telekommunikation und der…
(more)

Subjects/Keywords: Exakte Algorithmen; K-cardinality tree; Kombinatorische Optimierung; Network design; Survivable Netzwerk Design; 004

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kandyba-Chimani, M. (2011). Exact algorithms for network design problems using graph orientations. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27701

Not specified: Masters Thesis or Doctoral Dissertation

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

Kandyba-Chimani, Maria. “Exact algorithms for network design problems using graph orientations.” 2011. Thesis, Technische Universität Dortmund. Accessed September 22, 2019. http://hdl.handle.net/2003/27701.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kandyba-Chimani, Maria. “Exact algorithms for network design problems using graph orientations.” 2011. Web. 22 Sep 2019.

Vancouver:

Kandyba-Chimani M. Exact algorithms for network design problems using graph orientations. [Internet] [Thesis]. Technische Universität Dortmund; 2011. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2003/27701.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kandyba-Chimani M. Exact algorithms for network design problems using graph orientations. [Thesis]. Technische Universität Dortmund; 2011. Available from: http://hdl.handle.net/2003/27701

Not specified: Masters Thesis or Doctoral Dissertation

10. Borges, Bruno Andrade. O infinito na matemática.

Degree: Mestrado, Mestrado Profissional em Matemática em Rede Nacional, 2014, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-08042015-143010/ ;

►

Nesta dissertação, abordaremos os dois tipos de infinitos existentes: o infinito potencial e o infinito actual. Apresentaremos algumas situações, exemplos que caracterizam cada um desses… (more)

Subjects/Keywords: Actual; Cardinalidade; Cardinality; Conjuntos enumeráveis; Countable sets; Infinito; Infinito actual; Infinito potencial; Infinity; Potential infinity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Borges, B. A. (2014). O infinito na matemática. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55136/tde-08042015-143010/ ;

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

Borges, Bruno Andrade. “O infinito na matemática.” 2014. Masters Thesis, University of São Paulo. Accessed September 22, 2019. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-08042015-143010/ ;.

MLA Handbook (7^{th} Edition):

Borges, Bruno Andrade. “O infinito na matemática.” 2014. Web. 22 Sep 2019.

Vancouver:

Borges BA. O infinito na matemática. [Internet] [Masters thesis]. University of São Paulo; 2014. [cited 2019 Sep 22]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-08042015-143010/ ;.

Council of Science Editors:

Borges BA. O infinito na matemática. [Masters Thesis]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/55/55136/tde-08042015-143010/ ;

University of Georgia

11. Kalimurthy, Aravind. Adapting graph simulation algorithms for graph database query processing.

Degree: MS, Computer Science, 2017, University of Georgia

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

► With data exponentially increasing in almost all fields in today’s world, there comes the necessity of handling and querying the data efficiently. Recently, many graph…
(more)

Subjects/Keywords: Graph Database; Graph Simulation Algorithms; Edge Label; Cardinality; Query Processing; Widcard; Regular Expression

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kalimurthy, A. (2017). Adapting graph simulation algorithms for graph database query processing. (Masters Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/37802

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

Kalimurthy, Aravind. “Adapting graph simulation algorithms for graph database query processing.” 2017. Masters Thesis, University of Georgia. Accessed September 22, 2019. http://hdl.handle.net/10724/37802.

MLA Handbook (7^{th} Edition):

Kalimurthy, Aravind. “Adapting graph simulation algorithms for graph database query processing.” 2017. Web. 22 Sep 2019.

Vancouver:

Kalimurthy A. Adapting graph simulation algorithms for graph database query processing. [Internet] [Masters thesis]. University of Georgia; 2017. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10724/37802.

Council of Science Editors:

Kalimurthy A. Adapting graph simulation algorithms for graph database query processing. [Masters Thesis]. University of Georgia; 2017. Available from: http://hdl.handle.net/10724/37802

UCLA

12. Zhang, Qiang. Modern Models for Learning Large-Scale Highly Skewed Online Advertising Data.

Degree: Statistics, 2015, UCLA

URL: http://www.escholarship.org/uc/item/7mc0k1v8

► Click through rate (CTR) and conversation rate estimation are two core prediction tasks in online advertising. However, four major challenges emerged as data scientists trying…
(more)

Subjects/Keywords: Statistics; Marketing; Data Mining; High Cardinality; Imbalanced Data; Large-scale Classification; Machine Learning; Online Advertising

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhang, Q. (2015). Modern Models for Learning Large-Scale Highly Skewed Online Advertising Data. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/7mc0k1v8

Not specified: Masters Thesis or Doctoral Dissertation

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

Zhang, Qiang. “Modern Models for Learning Large-Scale Highly Skewed Online Advertising Data.” 2015. Thesis, UCLA. Accessed September 22, 2019. http://www.escholarship.org/uc/item/7mc0k1v8.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Qiang. “Modern Models for Learning Large-Scale Highly Skewed Online Advertising Data.” 2015. Web. 22 Sep 2019.

Vancouver:

Zhang Q. Modern Models for Learning Large-Scale Highly Skewed Online Advertising Data. [Internet] [Thesis]. UCLA; 2015. [cited 2019 Sep 22]. Available from: http://www.escholarship.org/uc/item/7mc0k1v8.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang Q. Modern Models for Learning Large-Scale Highly Skewed Online Advertising Data. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/7mc0k1v8

Not specified: Masters Thesis or Doctoral Dissertation

University of Western Ontario

13. Wallentinsen, Kristen. Fuzzy Family Ties: Familial Similarity Between Melodic Contours of Different Cardinalities.

Degree: 2017, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/5037

► All melodies have shape: a pattern of ascents, descents, and plateaus that occur as music moves through time. This shape—or contour—is one of a melody’s…
(more)

Subjects/Keywords: Melodic Contour; Fuzzy Set Theory; Cardinality; Plainchant; Johannes Brahms; Minimalism; Music Theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wallentinsen, K. (2017). Fuzzy Family Ties: Familial Similarity Between Melodic Contours of Different Cardinalities. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/5037

Not specified: Masters Thesis or Doctoral Dissertation

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

Wallentinsen, Kristen. “Fuzzy Family Ties: Familial Similarity Between Melodic Contours of Different Cardinalities.” 2017. Thesis, University of Western Ontario. Accessed September 22, 2019. https://ir.lib.uwo.ca/etd/5037.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wallentinsen, Kristen. “Fuzzy Family Ties: Familial Similarity Between Melodic Contours of Different Cardinalities.” 2017. Web. 22 Sep 2019.

Vancouver:

Wallentinsen K. Fuzzy Family Ties: Familial Similarity Between Melodic Contours of Different Cardinalities. [Internet] [Thesis]. University of Western Ontario; 2017. [cited 2019 Sep 22]. Available from: https://ir.lib.uwo.ca/etd/5037.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wallentinsen K. Fuzzy Family Ties: Familial Similarity Between Melodic Contours of Different Cardinalities. [Thesis]. University of Western Ontario; 2017. Available from: https://ir.lib.uwo.ca/etd/5037

Not specified: Masters Thesis or Doctoral Dissertation

University of Otago

14. Walles, Hayden. A Perceptual Basis for Noun Phrase Syntax .

Degree: 2010, University of Otago

URL: http://hdl.handle.net/10523/319

► Human language is the result of both biological and cultural evolution. To have the best chance of understanding language we must seek all the constraints…
(more)

Subjects/Keywords: linguistics; cardinality blindness; noun phrase; visual attention; visual classification; sensorimotor; number; computational model

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Walles, H. (2010). A Perceptual Basis for Noun Phrase Syntax . (Doctoral Dissertation). University of Otago. Retrieved from http://hdl.handle.net/10523/319

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

Walles, Hayden. “A Perceptual Basis for Noun Phrase Syntax .” 2010. Doctoral Dissertation, University of Otago. Accessed September 22, 2019. http://hdl.handle.net/10523/319.

MLA Handbook (7^{th} Edition):

Walles, Hayden. “A Perceptual Basis for Noun Phrase Syntax .” 2010. Web. 22 Sep 2019.

Vancouver:

Walles H. A Perceptual Basis for Noun Phrase Syntax . [Internet] [Doctoral dissertation]. University of Otago; 2010. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/10523/319.

Council of Science Editors:

Walles H. A Perceptual Basis for Noun Phrase Syntax . [Doctoral Dissertation]. University of Otago; 2010. Available from: http://hdl.handle.net/10523/319

University of Illinois – Urbana-Champaign

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

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

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

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

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

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhou, Zeyu. “Per-flow cardinality estimation based on virtual LogLog sketching.” 2016. Web. 22 Sep 2019.

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

16. Boyko, Mykyta. New Approaches to Robust Optimization with Applications.

Degree: PhD, Industrial and Systems Engineering, 2010, University of Florida

URL: http://ufdc.ufl.edu/UFE0041990

► The dissertation focuses on a popular percentile-based risk measure known as Conditional Value at Risk (CVaR). CVaR has emerged from financial applications and allows obtaining…
(more)

Subjects/Keywords: Algorithms; Cardinality; Jamming; Linear programming; Mathematical programming; Modeling; Optimal solutions; Robust optimization; Scheduling; Sensors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Boyko, M. (2010). New Approaches to Robust Optimization with Applications. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0041990

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

Boyko, Mykyta. “New Approaches to Robust Optimization with Applications.” 2010. Doctoral Dissertation, University of Florida. Accessed September 22, 2019. http://ufdc.ufl.edu/UFE0041990.

MLA Handbook (7^{th} Edition):

Boyko, Mykyta. “New Approaches to Robust Optimization with Applications.” 2010. Web. 22 Sep 2019.

Vancouver:

Boyko M. New Approaches to Robust Optimization with Applications. [Internet] [Doctoral dissertation]. University of Florida; 2010. [cited 2019 Sep 22]. Available from: http://ufdc.ufl.edu/UFE0041990.

Council of Science Editors:

Boyko M. New Approaches to Robust Optimization with Applications. [Doctoral Dissertation]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0041990

17. Nagarajan, K. Studies in graph theory decomposition of graphs into paths and related topics;.

Degree: 2014, Manonmaniam Sundaranar University

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

newline

Subjects/Keywords: cardinality; equidomination; Graphs; line clique cover; star

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nagarajan, K. (2014). Studies in graph theory decomposition of graphs into paths and related topics;. (Thesis). Manonmaniam Sundaranar University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/24892

Not specified: Masters Thesis or Doctoral Dissertation

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

Nagarajan, K. “Studies in graph theory decomposition of graphs into paths and related topics;.” 2014. Thesis, Manonmaniam Sundaranar University. Accessed September 22, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/24892.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nagarajan, K. “Studies in graph theory decomposition of graphs into paths and related topics;.” 2014. Web. 22 Sep 2019.

Vancouver:

Nagarajan K. Studies in graph theory decomposition of graphs into paths and related topics;. [Internet] [Thesis]. Manonmaniam Sundaranar University; 2014. [cited 2019 Sep 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24892.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nagarajan K. Studies in graph theory decomposition of graphs into paths and related topics;. [Thesis]. Manonmaniam Sundaranar University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24892

Not specified: Masters Thesis or Doctoral Dissertation

18. Kamnang Wanko, Patrick. Optimisation des requêtes skyline multidimensionnelles : Optimization of multidimensional skyline queries.

Degree: Docteur es, Informatique, 2017, Bordeaux

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

►

Dans le cadre de la sélection de meilleurs éléments au sein d’une base de données multidimensionnelle, plusieurs types de requêtes ont été définies. L’opérateur skyline… (more)

Subjects/Keywords: Skyline; Cardinalité; Taille; Optimisation; Skycube; Skycuboid; Dépendance fonctionnelle; Skyline; Cardinality; Size; Optimization; Skycube; Skycuboid; Functional Dependency

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kamnang Wanko, P. (2017). Optimisation des requêtes skyline multidimensionnelles : Optimization of multidimensional skyline queries. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2017BORD0010

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

Kamnang Wanko, Patrick. “Optimisation des requêtes skyline multidimensionnelles : Optimization of multidimensional skyline queries.” 2017. Doctoral Dissertation, Bordeaux. Accessed September 22, 2019. http://www.theses.fr/2017BORD0010.

MLA Handbook (7^{th} Edition):

Kamnang Wanko, Patrick. “Optimisation des requêtes skyline multidimensionnelles : Optimization of multidimensional skyline queries.” 2017. Web. 22 Sep 2019.

Vancouver:

Kamnang Wanko P. Optimisation des requêtes skyline multidimensionnelles : Optimization of multidimensional skyline queries. [Internet] [Doctoral dissertation]. Bordeaux; 2017. [cited 2019 Sep 22]. Available from: http://www.theses.fr/2017BORD0010.

Council of Science Editors:

Kamnang Wanko P. Optimisation des requêtes skyline multidimensionnelles : Optimization of multidimensional skyline queries. [Doctoral Dissertation]. Bordeaux; 2017. Available from: http://www.theses.fr/2017BORD0010

University of Florida

19. Fan,Neng. Combinatorial and Nonlinear Optimization Methods with Applications in Data Clustering, Biclustering and Power Systems.

Degree: PhD, Industrial and Systems Engineering, 2011, University of Florida

URL: http://ufdc.ufl.edu/UFE0043200

► With the increasing number of databases appearing in computational biology, biomedical engineering, consumers' behavior survey, social networks, power systems, and many other areas, finding the…
(more)

Subjects/Keywords: Algorithms; Bioinformatics; Cardinality; Integers; Linear programming; Matrices; Objective functions; Power grids; Spectral methods; Vertices; biclustering – clustering – combinatorial – graph – integer – islanding – nonlinear

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fan,Neng. (2011). Combinatorial and Nonlinear Optimization Methods with Applications in Data Clustering, Biclustering and Power Systems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0043200

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

Author name may be incomplete

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

Fan,Neng. “Combinatorial and Nonlinear Optimization Methods with Applications in Data Clustering, Biclustering and Power Systems.” 2011. Doctoral Dissertation, University of Florida. Accessed September 22, 2019. http://ufdc.ufl.edu/UFE0043200.

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

Author name may be incomplete

MLA Handbook (7^{th} Edition):

Fan,Neng. “Combinatorial and Nonlinear Optimization Methods with Applications in Data Clustering, Biclustering and Power Systems.” 2011. Web. 22 Sep 2019.

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

Author name may be incomplete

Vancouver:

Fan,Neng. Combinatorial and Nonlinear Optimization Methods with Applications in Data Clustering, Biclustering and Power Systems. [Internet] [Doctoral dissertation]. University of Florida; 2011. [cited 2019 Sep 22]. Available from: http://ufdc.ufl.edu/UFE0043200.

Author name may be incomplete

Council of Science Editors:

Fan,Neng. Combinatorial and Nonlinear Optimization Methods with Applications in Data Clustering, Biclustering and Power Systems. [Doctoral Dissertation]. University of Florida; 2011. Available from: http://ufdc.ufl.edu/UFE0043200

Author name may be incomplete

University of Florida

20. Sullivan, Kelly M. Two-Level System Interdiction.

Degree: PhD, Industrial and Systems Engineering, 2012, University of Florida

URL: http://ufdc.ufl.edu/UFE0044471

► We consider a number of interdiction problems with applications in homeland security. First, we study a stochastic interdiction model formulated by Morton et al. (IIE…
(more)

Subjects/Keywords: Algorithms; Cardinality; Integers; Linear programming; Objective functions; Operations research; Optimal solutions; P values; Sensors; Smuggling; discrete – interdiction – network – nuclear – optimization

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sullivan, K. M. (2012). Two-Level System Interdiction. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044471

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

Sullivan, Kelly M. “Two-Level System Interdiction.” 2012. Doctoral Dissertation, University of Florida. Accessed September 22, 2019. http://ufdc.ufl.edu/UFE0044471.

MLA Handbook (7^{th} Edition):

Sullivan, Kelly M. “Two-Level System Interdiction.” 2012. Web. 22 Sep 2019.

Vancouver:

Sullivan KM. Two-Level System Interdiction. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2019 Sep 22]. Available from: http://ufdc.ufl.edu/UFE0044471.

Council of Science Editors:

Sullivan KM. Two-Level System Interdiction. [Doctoral Dissertation]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044471

McMaster University

21. Safilian, Aliakbar. BEHAVIOURAL FOUNDATIONS OF FEATURE MODELING.

Degree: PhD, 2016, McMaster University

URL: http://hdl.handle.net/11375/18975

►

Software product line engineering is a common method for designing complex software systems. Feature modeling is the most common approach to specify product lines. A… (more)

Subjects/Keywords: Software Product Lines; Feature Modeling; Basic Feature Models; Cardinality-Based Feature Models; Modal Logic; Multiset Theory; Formal Languages; Faithful Semantics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Safilian, A. (2016). BEHAVIOURAL FOUNDATIONS OF FEATURE MODELING. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/18975

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

Safilian, Aliakbar. “BEHAVIOURAL FOUNDATIONS OF FEATURE MODELING.” 2016. Doctoral Dissertation, McMaster University. Accessed September 22, 2019. http://hdl.handle.net/11375/18975.

MLA Handbook (7^{th} Edition):

Safilian, Aliakbar. “BEHAVIOURAL FOUNDATIONS OF FEATURE MODELING.” 2016. Web. 22 Sep 2019.

Vancouver:

Safilian A. BEHAVIOURAL FOUNDATIONS OF FEATURE MODELING. [Internet] [Doctoral dissertation]. McMaster University; 2016. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/11375/18975.

Council of Science Editors:

Safilian A. BEHAVIOURAL FOUNDATIONS OF FEATURE MODELING. [Doctoral Dissertation]. McMaster University; 2016. Available from: http://hdl.handle.net/11375/18975

22.
Moneta-Koehler, Liane Alise.
Beyond *cardinality*: how children learn to reason about exact numbers.

Degree: PhD, Psychology, 2015, Vanderbilt University

URL: http://etd.library.vanderbilt.edu/available/etd-03202015-145035/ ;

► *Cardinality*, the ability to state the quantity of a set, is an important skill in the development of precise numerical reasoning abilities. This set of…
(more)

Subjects/Keywords: language; mathematics; numerical reasoning; cardinality; development

…confluence of
advances in understanding *cardinality* and the critical role that exact number words… …this introduction
describes *cardinality* and how children learn to represent precise… …final section of the
introduction considers whether *cardinality* is sufficient for exact… …numerical reasoning and what
other skills may be necessary.
*Cardinality*
*Cardinality* refers to the… …associates *cardinality* with the last word in a count sequence, one
procedure used to determine…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Moneta-Koehler, L. A. (2015). Beyond cardinality: how children learn to reason about exact numbers. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-03202015-145035/ ;

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

Moneta-Koehler, Liane Alise. “Beyond cardinality: how children learn to reason about exact numbers.” 2015. Doctoral Dissertation, Vanderbilt University. Accessed September 22, 2019. http://etd.library.vanderbilt.edu/available/etd-03202015-145035/ ;.

MLA Handbook (7^{th} Edition):

Moneta-Koehler, Liane Alise. “Beyond cardinality: how children learn to reason about exact numbers.” 2015. Web. 22 Sep 2019.

Vancouver:

Moneta-Koehler LA. Beyond cardinality: how children learn to reason about exact numbers. [Internet] [Doctoral dissertation]. Vanderbilt University; 2015. [cited 2019 Sep 22]. Available from: http://etd.library.vanderbilt.edu/available/etd-03202015-145035/ ;.

Council of Science Editors:

Moneta-Koehler LA. Beyond cardinality: how children learn to reason about exact numbers. [Doctoral Dissertation]. Vanderbilt University; 2015. Available from: http://etd.library.vanderbilt.edu/available/etd-03202015-145035/ ;

University of Florida

23. Sonuc, Sibel B. Multi-Stage MIP Formulation and Exact Solution Approaches for Combinatorial Network Problems.

Degree: PhD, Industrial and Systems Engineering, 2012, University of Florida

URL: http://ufdc.ufl.edu/UFE0044607

► Many complex optimization problems arising in real-world settings cannot reasonably be solved by hand, or by a team of *subject* matter experts. The limiting factors…
(more)

Subjects/Keywords: Algorithms; Ambiguity; Cardinality; Heuristics; Integers; Linear programming; Objective functions; Optimal solutions; Sensors; Vertices; graph – integer – large – network – optimization – programming – sensors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sonuc, S. B. (2012). Multi-Stage MIP Formulation and Exact Solution Approaches for Combinatorial Network Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044607

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

Sonuc, Sibel B. “Multi-Stage MIP Formulation and Exact Solution Approaches for Combinatorial Network Problems.” 2012. Doctoral Dissertation, University of Florida. Accessed September 22, 2019. http://ufdc.ufl.edu/UFE0044607.

MLA Handbook (7^{th} Edition):

Sonuc, Sibel B. “Multi-Stage MIP Formulation and Exact Solution Approaches for Combinatorial Network Problems.” 2012. Web. 22 Sep 2019.

Vancouver:

Sonuc SB. Multi-Stage MIP Formulation and Exact Solution Approaches for Combinatorial Network Problems. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2019 Sep 22]. Available from: http://ufdc.ufl.edu/UFE0044607.

Council of Science Editors:

Sonuc SB. Multi-Stage MIP Formulation and Exact Solution Approaches for Combinatorial Network Problems. [Doctoral Dissertation]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044607

Indian Institute of Science

24. Dey, Atreyee. Efficiently Approximating Query Optimizer Diagrams.

Degree: 2009, Indian Institute of Science

URL: http://hdl.handle.net/2005/920

► Modern database systems use a query optimizer to identify the most efficient strategy, called “query execution plan”, to execute declarative SQL queries. The role of…
(more)

Subjects/Keywords: Query Optimization; Query Processing; Optimizer Diagrams; Plan Diagram Approximation; Cost Diagram Approximation; Cardinality Diagram Approximation; Query Optimization - Algorithms; Picasso; PostgreSQL; Query Optimizer; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dey, A. (2009). Efficiently Approximating Query Optimizer Diagrams. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/920

Not specified: Masters Thesis or Doctoral Dissertation

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

Dey, Atreyee. “Efficiently Approximating Query Optimizer Diagrams.” 2009. Thesis, Indian Institute of Science. Accessed September 22, 2019. http://hdl.handle.net/2005/920.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Dey, Atreyee. “Efficiently Approximating Query Optimizer Diagrams.” 2009. Web. 22 Sep 2019.

Vancouver:

Dey A. Efficiently Approximating Query Optimizer Diagrams. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/2005/920.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dey A. Efficiently Approximating Query Optimizer Diagrams. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/920

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

25. Bhojwani, Praveen Sunder. Mapping multimode system communication to a network-on-a-chip (NoC).

Degree: 2004, Texas A&M University

URL: http://hdl.handle.net/1969.1/299

► Decisions regarding the mapping of system-on-chip (SoC) components onto a NoC become more difficult with increasing complexity of system design. These complex systems capable of…
(more)

Subjects/Keywords: network-on-chip; fixed cardinality transformation; system-on-chip; heuristic

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhojwani, P. S. (2004). Mapping multimode system communication to a network-on-a-chip (NoC). (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/299

Not specified: Masters Thesis or Doctoral Dissertation

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

Bhojwani, Praveen Sunder. “Mapping multimode system communication to a network-on-a-chip (NoC).” 2004. Thesis, Texas A&M University. Accessed September 22, 2019. http://hdl.handle.net/1969.1/299.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Bhojwani, Praveen Sunder. “Mapping multimode system communication to a network-on-a-chip (NoC).” 2004. Web. 22 Sep 2019.

Vancouver:

Bhojwani PS. Mapping multimode system communication to a network-on-a-chip (NoC). [Internet] [Thesis]. Texas A&M University; 2004. [cited 2019 Sep 22]. Available from: http://hdl.handle.net/1969.1/299.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bhojwani PS. Mapping multimode system communication to a network-on-a-chip (NoC). [Thesis]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/299

Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

26. Cosma, Ioana Ada. Dimension reduction of streaming data via random projections.

Degree: PhD, 2009, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:09eafd84-8cb3-4e54-8daf-18db7832bcfc ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504352

► A data stream is a transiently observed sequence of data elements that arrive unordered, with repetitions, and at very high rate of transmission. Examples include…
(more)

Subjects/Keywords: 519.2; Computationally-intensive statistics : Probability : Applications and algorithms : data streaming : random projections : L-estimation : maximum likelihood estimation : cardinality : entropy : MCMC convergence diagnostics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Cosma, I. A. (2009). Dimension reduction of streaming data via random projections. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:09eafd84-8cb3-4e54-8daf-18db7832bcfc ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504352

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

Cosma, Ioana Ada. “Dimension reduction of streaming data via random projections.” 2009. Doctoral Dissertation, University of Oxford. Accessed September 22, 2019. http://ora.ox.ac.uk/objects/uuid:09eafd84-8cb3-4e54-8daf-18db7832bcfc ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504352.

MLA Handbook (7^{th} Edition):

Cosma, Ioana Ada. “Dimension reduction of streaming data via random projections.” 2009. Web. 22 Sep 2019.

Vancouver:

Cosma IA. Dimension reduction of streaming data via random projections. [Internet] [Doctoral dissertation]. University of Oxford; 2009. [cited 2019 Sep 22]. Available from: http://ora.ox.ac.uk/objects/uuid:09eafd84-8cb3-4e54-8daf-18db7832bcfc ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504352.

Council of Science Editors:

Cosma IA. Dimension reduction of streaming data via random projections. [Doctoral Dissertation]. University of Oxford; 2009. Available from: http://ora.ox.ac.uk/objects/uuid:09eafd84-8cb3-4e54-8daf-18db7832bcfc ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.504352

27.
Li, Yibo.
Solving *cardinality* constrained portfolio optimisation problem using genetic algorithms and ant colony optimisation.

Degree: PhD, 2015, Brunel University

URL: http://bura.brunel.ac.uk/handle/2438/10867 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.649380

► In this thesis we consider solution approaches for the index tacking problem, in which we aim to reproduces the performance of a market index without…
(more)

Subjects/Keywords: 519.6; Genetics algorithm; Ant colony optimization; Cardinality constrained portfolio optimization

…different data sets and find reliable
relations amongst the *cardinality*, the population size, and… …compares its performance to a mean–
variance model in *cardinality* constrained efficient frontier… …problem, which includes the
transaction costs, *cardinality* constraints, and the limitations of… …size. In addition, the size of the problems is generally small and the
*cardinality* was fixed…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Y. (2015). Solving cardinality constrained portfolio optimisation problem using genetic algorithms and ant colony optimisation. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/10867 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.649380

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

Li, Yibo. “Solving cardinality constrained portfolio optimisation problem using genetic algorithms and ant colony optimisation.” 2015. Doctoral Dissertation, Brunel University. Accessed September 22, 2019. http://bura.brunel.ac.uk/handle/2438/10867 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.649380.

MLA Handbook (7^{th} Edition):

Li, Yibo. “Solving cardinality constrained portfolio optimisation problem using genetic algorithms and ant colony optimisation.” 2015. Web. 22 Sep 2019.

Vancouver:

Li Y. Solving cardinality constrained portfolio optimisation problem using genetic algorithms and ant colony optimisation. [Internet] [Doctoral dissertation]. Brunel University; 2015. [cited 2019 Sep 22]. Available from: http://bura.brunel.ac.uk/handle/2438/10867 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.649380.

Council of Science Editors:

Li Y. Solving cardinality constrained portfolio optimisation problem using genetic algorithms and ant colony optimisation. [Doctoral Dissertation]. Brunel University; 2015. Available from: http://bura.brunel.ac.uk/handle/2438/10867 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.649380

University of Florida

28. Senra, Antonio Augusto. Defending the Possibility of an Infinite Past.

Degree: 2014, University of Florida

URL: http://ufdc.ufl.edu/AA00057361

► Events in time either had a beginning, or they occur infinitely far back into the past. These are the only possibilities for the nature of…
(more)

Subjects/Keywords: Books; Cardinality; Correspondence principle; Infinite sets; Infinity; Libraries; Mathematical intuitionism; Mathematics; Natural numbers; Ordinal numbers; Craig, William Lane; Time (Law) – Philosophy; Time – Philosophy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Senra, A. A. (2014). Defending the Possibility of an Infinite Past. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00057361

Not specified: Masters Thesis or Doctoral Dissertation

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

Senra, Antonio Augusto. “Defending the Possibility of an Infinite Past.” 2014. Thesis, University of Florida. Accessed September 22, 2019. http://ufdc.ufl.edu/AA00057361.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Senra, Antonio Augusto. “Defending the Possibility of an Infinite Past.” 2014. Web. 22 Sep 2019.

Vancouver:

Senra AA. Defending the Possibility of an Infinite Past. [Internet] [Thesis]. University of Florida; 2014. [cited 2019 Sep 22]. Available from: http://ufdc.ufl.edu/AA00057361.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Senra AA. Defending the Possibility of an Infinite Past. [Thesis]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/AA00057361

Not specified: Masters Thesis or Doctoral Dissertation

29. Ortl, Aljoša. MATEMATIČNA OPTIMIZACIJA PORTFELJA S PRISTOPI MEAN-VARIANCE, MEAN-CVAR IN MAX-OMEGA Z OMEJITVIJO NABORA DELNIC.

Degree: 2014, Univerza v Mariboru

URL: https://dk.um.si/IzpisGradiva.php?id=45792 ; https://dk.um.si/Dokument.php?id=66542&dn= ; https://plus.si.cobiss.net/opac7/bib/11805724?lang=sl

►

Vprašanje, kam vložiti finančna sredstva, je zelo zahtevno. Pri tem nam lahko pomaga matematična optimizacija portfelja. Tradicionalni pristopi kot, je Markowitzevega Mean-Variance optimizacija s kvadratičnim… (more)

Subjects/Keywords: Omega; optimizacija portfelja; genetski algoritem; diferencialna evolucija; CVaR; omejitev izbora največjega števila delnic v portfelj; Omega; portfolio optimization; genetic algorithm; differential evolution; CVaR; cardinality constraint; info:eu-repo/classification/udc/336.76

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ortl, A. (2014). MATEMATIČNA OPTIMIZACIJA PORTFELJA S PRISTOPI MEAN-VARIANCE, MEAN-CVAR IN MAX-OMEGA Z OMEJITVIJO NABORA DELNIC. (Masters Thesis). Univerza v Mariboru. Retrieved from https://dk.um.si/IzpisGradiva.php?id=45792 ; https://dk.um.si/Dokument.php?id=66542&dn= ; https://plus.si.cobiss.net/opac7/bib/11805724?lang=sl

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

Ortl, Aljoša. “MATEMATIČNA OPTIMIZACIJA PORTFELJA S PRISTOPI MEAN-VARIANCE, MEAN-CVAR IN MAX-OMEGA Z OMEJITVIJO NABORA DELNIC.” 2014. Masters Thesis, Univerza v Mariboru. Accessed September 22, 2019. https://dk.um.si/IzpisGradiva.php?id=45792 ; https://dk.um.si/Dokument.php?id=66542&dn= ; https://plus.si.cobiss.net/opac7/bib/11805724?lang=sl.

MLA Handbook (7^{th} Edition):

Ortl, Aljoša. “MATEMATIČNA OPTIMIZACIJA PORTFELJA S PRISTOPI MEAN-VARIANCE, MEAN-CVAR IN MAX-OMEGA Z OMEJITVIJO NABORA DELNIC.” 2014. Web. 22 Sep 2019.

Vancouver:

Ortl A. MATEMATIČNA OPTIMIZACIJA PORTFELJA S PRISTOPI MEAN-VARIANCE, MEAN-CVAR IN MAX-OMEGA Z OMEJITVIJO NABORA DELNIC. [Internet] [Masters thesis]. Univerza v Mariboru; 2014. [cited 2019 Sep 22]. Available from: https://dk.um.si/IzpisGradiva.php?id=45792 ; https://dk.um.si/Dokument.php?id=66542&dn= ; https://plus.si.cobiss.net/opac7/bib/11805724?lang=sl.

Council of Science Editors:

Ortl A. MATEMATIČNA OPTIMIZACIJA PORTFELJA S PRISTOPI MEAN-VARIANCE, MEAN-CVAR IN MAX-OMEGA Z OMEJITVIJO NABORA DELNIC. [Masters Thesis]. Univerza v Mariboru; 2014. Available from: https://dk.um.si/IzpisGradiva.php?id=45792 ; https://dk.um.si/Dokument.php?id=66542&dn= ; https://plus.si.cobiss.net/opac7/bib/11805724?lang=sl

30. Moraes Júnior, Rogério Jacinto de. Enumerabilidade e Não Enumerabilidade de conjuntos: uma abordagem para o Ensino Básico.

Degree: 2015, Universidade Federal do Amazonas

URL: http://tede.ufam.edu.br/handle/tede/4601

►

Neste trabalho abordaremos alguns assuntos tratados brevemente durante o curso de graduação tais como enumerabilidade e não enumerabilidade de conjuntos, cardinalidade e outros assuntos correlatos.… (more)

Subjects/Keywords: Ensino aprendizagem - Matemática; Enumerabilidade e Não enumerabilidade; Cardinalidade; Hipótese do Contínuo; Teaching-learning; Countable and Non-countable; Cardinality; The Continuum Hypothesis; CIÊNCIAS EXATAS E DA TERRA: MATEMÁTICA

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Moraes Júnior, R. J. d. (2015). Enumerabilidade e Não Enumerabilidade de conjuntos: uma abordagem para o Ensino Básico. (Masters Thesis). Universidade Federal do Amazonas. Retrieved from http://tede.ufam.edu.br/handle/tede/4601

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

Moraes Júnior, Rogério Jacinto de. “Enumerabilidade e Não Enumerabilidade de conjuntos: uma abordagem para o Ensino Básico.” 2015. Masters Thesis, Universidade Federal do Amazonas. Accessed September 22, 2019. http://tede.ufam.edu.br/handle/tede/4601.

MLA Handbook (7^{th} Edition):

Moraes Júnior, Rogério Jacinto de. “Enumerabilidade e Não Enumerabilidade de conjuntos: uma abordagem para o Ensino Básico.” 2015. Web. 22 Sep 2019.

Vancouver:

Moraes Júnior RJd. Enumerabilidade e Não Enumerabilidade de conjuntos: uma abordagem para o Ensino Básico. [Internet] [Masters thesis]. Universidade Federal do Amazonas; 2015. [cited 2019 Sep 22]. Available from: http://tede.ufam.edu.br/handle/tede/4601.

Council of Science Editors:

Moraes Júnior RJd. Enumerabilidade e Não Enumerabilidade de conjuntos: uma abordagem para o Ensino Básico. [Masters Thesis]. Universidade Federal do Amazonas; 2015. Available from: http://tede.ufam.edu.br/handle/tede/4601