Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(regular AND random wave forces). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Brno University of Technology

1. Stanek, Timotej. Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions.

Degree: 2018, Brno University of Technology

 This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection… (more)

Subjects/Keywords: Systém detekce útoků; IDS; bezpečnost sítí; regulární výraz; PCRE; konečný automat; deterministický konečný automat; nedeterministický konečný automat; shlukovaní regulárních výrazů; genetický algoritmus; Random Search; Intrusion Detection System; IDS; network security; regular expression; PCRE; finite-state automaton; deterministic finite-state automaton; non-deterministic finite-state automaton; regular expression grouping; genetic algorithm; Random Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stanek, T. (2018). Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52773

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Stanek, Timotej. “Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions.” 2018. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/52773.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Stanek, Timotej. “Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions.” 2018. Web. 11 Jul 2020.

Vancouver:

Stanek T. Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/52773.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Stanek T. Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/52773

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


ETH Zürich

2. Kamčev, Nina. Colourings of Graphs and Words.

Degree: 2018, ETH Zürich

 Extremal graph theory is concerned with the extreme values of a graph parameter over various classes of graphs. Randomised constructions have played a major role… (more)

Subjects/Keywords: random graphs; Ramsey theory; Graph theory; Random regular graph; Random processes; Hales-Jewett theorem; Local lemma; info:eu-repo/classification/ddc/510; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamčev, N. (2018). Colourings of Graphs and Words. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/282692

Chicago Manual of Style (16th Edition):

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Doctoral Dissertation, ETH Zürich. Accessed July 11, 2020. http://hdl.handle.net/20.500.11850/282692.

MLA Handbook (7th Edition):

Kamčev, Nina. “Colourings of Graphs and Words.” 2018. Web. 11 Jul 2020.

Vancouver:

Kamčev N. Colourings of Graphs and Words. [Internet] [Doctoral dissertation]. ETH Zürich; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/20.500.11850/282692.

Council of Science Editors:

Kamčev N. Colourings of Graphs and Words. [Doctoral Dissertation]. ETH Zürich; 2018. Available from: http://hdl.handle.net/20.500.11850/282692

3. Afram, Gabriel. Genomsökning av filsystem för att hitta personuppgifter : Med Linear chain conditional random field och Regular expression.

Degree: Information Systems and Technology, 2018, Mid Sweden University

The new General Data Protection Regulation (GDPR) Act will apply to all companies within the European Union after 25 May. This means stricter legal… (more)

Subjects/Keywords: GDPR; Linear chain conditional random field; Machine learning; Stanford NER; Precision; Recall; F-score; Regular expression; GDPR; Linear chain conditional random field; Maskininlärning; Stanford NER; Precision; Recall; F-score; Regular expression; Software Engineering; Programvaruteknik

…hitta personuppgifter – Med Linear chain conditional random field och Regular expression… …personuppgifter – Med Linear chain conditional random field och Regular expression Gabriel Afram 2018-06… …för att hitta personuppgifter – Med Linear chain conditional random field och Regular… …personuppgifter – Med Linear chain conditional random field och Regular expression Gabriel Afram 2018-06… …för att hitta personuppgifter – Med Linear chain conditional random field och Regular… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Afram, G. (2018). Genomsökning av filsystem för att hitta personuppgifter : Med Linear chain conditional random field och Regular expression. (Thesis). Mid Sweden University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34069

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Afram, Gabriel. “Genomsökning av filsystem för att hitta personuppgifter : Med Linear chain conditional random field och Regular expression.” 2018. Thesis, Mid Sweden University. Accessed July 11, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34069.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Afram, Gabriel. “Genomsökning av filsystem för att hitta personuppgifter : Med Linear chain conditional random field och Regular expression.” 2018. Web. 11 Jul 2020.

Vancouver:

Afram G. Genomsökning av filsystem för att hitta personuppgifter : Med Linear chain conditional random field och Regular expression. [Internet] [Thesis]. Mid Sweden University; 2018. [cited 2020 Jul 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34069.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Afram G. Genomsökning av filsystem för att hitta personuppgifter : Med Linear chain conditional random field och Regular expression. [Thesis]. Mid Sweden University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34069

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. K. SUBBIAH. FORCES ON A SMOOTH SUBMARINE PIPELINE IN REGULAR AND RANDOM WAVES.

Degree: 1989, National University of Singapore

Subjects/Keywords: Submarine pipeline; regular and random wave forces; hydrodynamic coefficients; maximum force and pressure coefficients; period parameter; scattering parameter; gap ratio and depth parameter

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SUBBIAH, K. (1989). FORCES ON A SMOOTH SUBMARINE PIPELINE IN REGULAR AND RANDOM WAVES. (Thesis). National University of Singapore. Retrieved from https://scholarbank.nus.edu.sg/handle/10635/165564

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

SUBBIAH, K.. “FORCES ON A SMOOTH SUBMARINE PIPELINE IN REGULAR AND RANDOM WAVES.” 1989. Thesis, National University of Singapore. Accessed July 11, 2020. https://scholarbank.nus.edu.sg/handle/10635/165564.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

SUBBIAH, K.. “FORCES ON A SMOOTH SUBMARINE PIPELINE IN REGULAR AND RANDOM WAVES.” 1989. Web. 11 Jul 2020.

Vancouver:

SUBBIAH K. FORCES ON A SMOOTH SUBMARINE PIPELINE IN REGULAR AND RANDOM WAVES. [Internet] [Thesis]. National University of Singapore; 1989. [cited 2020 Jul 11]. Available from: https://scholarbank.nus.edu.sg/handle/10635/165564.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

SUBBIAH K. FORCES ON A SMOOTH SUBMARINE PIPELINE IN REGULAR AND RANDOM WAVES. [Thesis]. National University of Singapore; 1989. Available from: https://scholarbank.nus.edu.sg/handle/10635/165564

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

5. Banna, Marwa. Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality.

Degree: Docteur es, Mathématiques, 2015, Université Paris-Est

Cette thèse porte essentiellement sur l'étude de la distribution spectrale limite de grandes matrices aléatoires dont les entrées sont corrélées et traite également d'inégalités de… (more)

Subjects/Keywords: Matrices Aléatoires; Matrices de covariance empirique; Distribution spectrale limite; Processus absolument régulier; Inégalités de déviation; Random Matrices; Sample covariance matrices; Limiting spectral distribution; Absolutely regular processes; Deviiation inequalities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Banna, M. (2015). Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2015PESC1107

Chicago Manual of Style (16th Edition):

Banna, Marwa. “Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality.” 2015. Doctoral Dissertation, Université Paris-Est. Accessed July 11, 2020. http://www.theses.fr/2015PESC1107.

MLA Handbook (7th Edition):

Banna, Marwa. “Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality.” 2015. Web. 11 Jul 2020.

Vancouver:

Banna M. Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality. [Internet] [Doctoral dissertation]. Université Paris-Est; 2015. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2015PESC1107.

Council of Science Editors:

Banna M. Distribution spectrale limite pour des matrices à entrées corrélées et inégalité de type Bernstein : Limiting spectral distribution for matrices with correlated entries and Bernstein-type inequality. [Doctoral Dissertation]. Université Paris-Est; 2015. Available from: http://www.theses.fr/2015PESC1107


Université Paris-Sud – Paris XI

6. Bettinelli, Jérémie. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.

Degree: Docteur es, Mathématiques, 2011, Université Paris-Sud – Paris XI

Au cours de ce travail, nous nous intéressons aux limites d'échelle de deux classes de cartes. Dans un premier temps, nous regardons les quadrangulations biparties… (more)

Subjects/Keywords: Cartes aléatoires; Arbres aléatoires; Limite d'échelle; Processus conditionnés; Convergence régulière; Topologie de Gromov; Dimension de Hausdorff; Arbre continu brownien; Espaces métriques aléatoires; Random maps; Random trees; Scaling limits; Conditioned processes; Regular convergence; Gromov topology; Hausdorff dimension; Brownian CRT; Random metric spaces

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bettinelli, J. (2011). Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2011PA112213

Chicago Manual of Style (16th Edition):

Bettinelli, Jérémie. “Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.” 2011. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed July 11, 2020. http://www.theses.fr/2011PA112213.

MLA Handbook (7th Edition):

Bettinelli, Jérémie. “Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps.” 2011. Web. 11 Jul 2020.

Vancouver:

Bettinelli J. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2011. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2011PA112213.

Council of Science Editors:

Bettinelli J. Limite d'échelle de cartes aléatoires en genre quelconque : Scaling Limit of Arbitrary Genus Random Maps. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2011. Available from: http://www.theses.fr/2011PA112213


Université Paris-Sud – Paris XI

7. Le Masson, Etienne. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.

Degree: Docteur es, Mathématiques, 2013, Université Paris-Sud – Paris XI

Dans cette thèse, nous étudions les propriétés de concentration des fonctions propres du laplacien discret sur des graphes réguliers de degré fixé dont le nombre… (more)

Subjects/Keywords: Fonctions propres du laplacien; Ergodicité quantique; Analyse semi-classique; Opérateurs pseudo-différentiels; Graphes réguliers; Grands graphes aléatoires; Laplacian eigenfunctions; Quantum ergodicity; Semi-classical analysis; Pseudo-differential operators; Regular graphs; Large random graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le Masson, E. (2013). Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2013PA112179

Chicago Manual of Style (16th Edition):

Le Masson, Etienne. “Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.” 2013. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed July 11, 2020. http://www.theses.fr/2013PA112179.

MLA Handbook (7th Edition):

Le Masson, Etienne. “Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs.” 2013. Web. 11 Jul 2020.

Vancouver:

Le Masson E. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2013PA112179.

Council of Science Editors:

Le Masson E. Ergodicité et fonctions propres du laplacien sur les grands graphes réguliers : Ergodicity and eigenfunctions of the Laplacian on large regular graphs. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2013. Available from: http://www.theses.fr/2013PA112179

8. Curado, Manuel. Structural Similarity: Applications to Object Recognition and Clustering .

Degree: 2018, University of Alicante

 In this thesis, we propose many developments in the context of Structural Similarity. We address both node (local) similarity and graph (global) similarity. Concerning node… (more)

Subjects/Keywords: Graph densification; Cut similarity; Spectral clustering; Dirichlet problems; Random walkers; Commute Times; Graph algorithms; Regular Partition; Szemeredi; Alzheimer's disease; Graphs; Return Random Walk; Net4lap; Directed graphs; Spectral graph theory; Graph entropy; Mutual information; Manifold alignment; m-Best Graph Matching; Binary-Tree Partitions; QAP; Graph sparsification; Shape simplification; Alpha shapes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Curado, M. (2018). Structural Similarity: Applications to Object Recognition and Clustering . (Thesis). University of Alicante. Retrieved from http://hdl.handle.net/10045/98110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Thesis, University of Alicante. Accessed July 11, 2020. http://hdl.handle.net/10045/98110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Curado, Manuel. “Structural Similarity: Applications to Object Recognition and Clustering .” 2018. Web. 11 Jul 2020.

Vancouver:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Internet] [Thesis]. University of Alicante; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10045/98110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Curado M. Structural Similarity: Applications to Object Recognition and Clustering . [Thesis]. University of Alicante; 2018. Available from: http://hdl.handle.net/10045/98110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Sharma, Abhishek. High throughput path selection for unstructured data center networks.

Degree: MS, 0112, 2013, University of Illinois – Urbana-Champaign

 The increase in demand and popularity of cloud and big data applications has driven the need for higher throughput data center network design. Recent work… (more)

Subjects/Keywords: Data Center; Multipath Transmission Control Protocol (MPTCP); Jellyfish; Shortest Paths; Disjoint Paths; Throughput; Random Regular Graph (RRG); Random Permutation Matrix; Switches; Servers; Ports; Network Density

…are all conducted on the Jellyfish topology. The topology is essentially a random regular… …computed once the random regular graph and traffic matrix has been constructed. We tested and… …random permutation traffic i.e. each source server randomly selects a destination server to… …from random permutation traffic. 3.4 Throughput computation In our experiments, we have… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sharma, A. (2013). High throughput path selection for unstructured data center networks. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/45451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Thesis, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/45451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sharma, Abhishek. “High throughput path selection for unstructured data center networks.” 2013. Web. 11 Jul 2020.

Vancouver:

Sharma A. High throughput path selection for unstructured data center networks. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/45451.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sharma A. High throughput path selection for unstructured data center networks. [Thesis]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/45451

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Delcourt, Michelle Jeannette. Viewing extremal and structural problems through a probabilistic lens.

Degree: PhD, Mathematics, 2017, University of Illinois – Urbana-Champaign

 This thesis focuses on using techniques from probability to solve problems from extremal and structural combinatorics. The main problem in Chapter 2 is determining the… (more)

Subjects/Keywords: Small subgraph conditioning method; Random regular graph; Intersecting families; Star decomposition; Structural graph theory; Extremal combinatorcs

…Decompositions of Random Regular Graphs As Barát and Thomassen [11] note, decompositions of… …translate this structural problem to the setting of random d-regular graphs: Theorem 3.1.8. A… …random 4-regular graph on n vertices has an orientation with out-degrees 0 or 3 asymptotically… …investigation is extending classical results to the so-called “sparse random setting”. If fn,m (H… …the sparse random setting. As demonstrated in this thesis for permutations and vector spaces… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Delcourt, M. J. (2017). Viewing extremal and structural problems through a probabilistic lens. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97669

Chicago Manual of Style (16th Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed July 11, 2020. http://hdl.handle.net/2142/97669.

MLA Handbook (7th Edition):

Delcourt, Michelle Jeannette. “Viewing extremal and structural problems through a probabilistic lens.” 2017. Web. 11 Jul 2020.

Vancouver:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2142/97669.

Council of Science Editors:

Delcourt MJ. Viewing extremal and structural problems through a probabilistic lens. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97669


University of Notre Dame

11. Xiaowen Liu. Performance Analysis and Topology Control of Large Wireless Networks With Fading</h1>.

Degree: Electrical Engineering, 2007, University of Notre Dame

  For the performance analysis of multihop wireless networks, the key issues are energy consumption, end-to-end reliability, delay and throughput. In the research of wireless… (more)

Subjects/Keywords: regular networks; sensor networks; random networks; Rayleigh fading; Poisson point process; topology control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, X. (2007). Performance Analysis and Topology Control of Large Wireless Networks With Fading</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/08612n51k4q

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Liu, Xiaowen. “Performance Analysis and Topology Control of Large Wireless Networks With Fading</h1>.” 2007. Thesis, University of Notre Dame. Accessed July 11, 2020. https://curate.nd.edu/show/08612n51k4q.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Liu, Xiaowen. “Performance Analysis and Topology Control of Large Wireless Networks With Fading</h1>.” 2007. Web. 11 Jul 2020.

Vancouver:

Liu X. Performance Analysis and Topology Control of Large Wireless Networks With Fading</h1>. [Internet] [Thesis]. University of Notre Dame; 2007. [cited 2020 Jul 11]. Available from: https://curate.nd.edu/show/08612n51k4q.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu X. Performance Analysis and Topology Control of Large Wireless Networks With Fading</h1>. [Thesis]. University of Notre Dame; 2007. Available from: https://curate.nd.edu/show/08612n51k4q

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of South Carolina

12. Clifton, Ann Wells. The Packing Chromatic Number of Random d-regular Graphs.

Degree: MS, Mathematics, 2015, University of South Carolina

  Let G = (V (G),E(G)) be a simple graph of order n and let i be a positive integer. Xi superset V (G) is… (more)

Subjects/Keywords: Mathematics; Physical Sciences and Mathematics; Packing Chromatic Number; Random d-regular Graphs; Configuration model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Clifton, A. W. (2015). The Packing Chromatic Number of Random d-regular Graphs. (Masters Thesis). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/3697

Chicago Manual of Style (16th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Masters Thesis, University of South Carolina. Accessed July 11, 2020. https://scholarcommons.sc.edu/etd/3697.

MLA Handbook (7th Edition):

Clifton, Ann Wells. “The Packing Chromatic Number of Random d-regular Graphs.” 2015. Web. 11 Jul 2020.

Vancouver:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Internet] [Masters thesis]. University of South Carolina; 2015. [cited 2020 Jul 11]. Available from: https://scholarcommons.sc.edu/etd/3697.

Council of Science Editors:

Clifton AW. The Packing Chromatic Number of Random d-regular Graphs. [Masters Thesis]. University of South Carolina; 2015. Available from: https://scholarcommons.sc.edu/etd/3697

13. Johnson, Tobias Lee. Eigenvalue fluctuations for random regular graphs.

Degree: PhD, 2014, University of Washington

 One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe… (more)

Subjects/Keywords: corners process; eigenvalue fluctuations; minors process; Poisson approximation; random regular graphs; Stein's method; Mathematics; mathematics

…for introducing me to research and to random regular graphs. I’m grateful to her for… …method and try to apply it to cycle counts of random regular graphs has shaped my mathematical… …investigating properties of eigenvalues of random regular graphs from the perspective of random matrix… …theory. 1.2 Stein’s method applied to random regular graphs Graph eigenvalues have a close… …exploit this by determining spectral properties of random regular graphs by looking at the… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, T. L. (2014). Eigenvalue fluctuations for random regular graphs. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/26531

Chicago Manual of Style (16th Edition):

Johnson, Tobias Lee. “Eigenvalue fluctuations for random regular graphs.” 2014. Doctoral Dissertation, University of Washington. Accessed July 11, 2020. http://hdl.handle.net/1773/26531.

MLA Handbook (7th Edition):

Johnson, Tobias Lee. “Eigenvalue fluctuations for random regular graphs.” 2014. Web. 11 Jul 2020.

Vancouver:

Johnson TL. Eigenvalue fluctuations for random regular graphs. [Internet] [Doctoral dissertation]. University of Washington; 2014. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1773/26531.

Council of Science Editors:

Johnson TL. Eigenvalue fluctuations for random regular graphs. [Doctoral Dissertation]. University of Washington; 2014. Available from: http://hdl.handle.net/1773/26531

.