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:(maximum weight connected subgraph). Showing records 1 – 30 of 7413 total matches.

[1] [2] [3] [4] [5] … [248]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Hume, Thomas. Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine.

Degree: Docteur es, Informatique, 2016, Bordeaux

Un des principaux défis de la bioinformatique moderne est de saisir le sens des données biologiques en constante croissance. Il est prépondérant de trouver de… (more)

Subjects/Keywords: Bioinformatique; Optimisation combinatoire; Maximum-Weight Connected Subgraph; Recherche de modules biologiques; Bioinformatics; Combinatorial optimization; Maximum-Weight Connected Subgraph; Biological module discovery

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hume, T. (2016). Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2016BORD0006

Chicago Manual of Style (16th Edition):

Hume, Thomas. “Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine.” 2016. Doctoral Dissertation, Bordeaux. Accessed December 08, 2019. http://www.theses.fr/2016BORD0006.

MLA Handbook (7th Edition):

Hume, Thomas. “Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine.” 2016. Web. 08 Dec 2019.

Vancouver:

Hume T. Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine. [Internet] [Doctoral dissertation]. Bordeaux; 2016. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2016BORD0006.

Council of Science Editors:

Hume T. Practical and theoretical approaches for module analysis of protein-protein interaction networks : Approches pratiques et théoriques pour l'analyse de modules au sein de réseaux d'interaction protéine-protéine. [Doctoral Dissertation]. Bordeaux; 2016. Available from: http://www.theses.fr/2016BORD0006


Texas A&M University

2. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

 In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,… (more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

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

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed December 08, 2019. http://hdl.handle.net/1969.1/155568.

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

MLA Handbook (7th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 08 Dec 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1969.1/155568.

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

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

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

3. Yang, Ping. Spanning Halin Subgraphs Involving Forbidden Subgraphs.

Degree: PhD, Mathematics and Statistics, 2016, Georgia State University

  In structural graph theory, connectivity is an important notation with a lot of applications. Tutte, in 1961, showed that a simple graph is 3-connected(more)

Subjects/Keywords: Forbidden pairs; Spanning subgraph; Halin graph; Strong spanning Halin subgraph; 3-connected graph; Claw-free; Z_3-free; B_{1; 2}-free.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, P. (2016). Spanning Halin Subgraphs Involving Forbidden Subgraphs. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/math_diss/29

Chicago Manual of Style (16th Edition):

Yang, Ping. “Spanning Halin Subgraphs Involving Forbidden Subgraphs.” 2016. Doctoral Dissertation, Georgia State University. Accessed December 08, 2019. https://scholarworks.gsu.edu/math_diss/29.

MLA Handbook (7th Edition):

Yang, Ping. “Spanning Halin Subgraphs Involving Forbidden Subgraphs.” 2016. Web. 08 Dec 2019.

Vancouver:

Yang P. Spanning Halin Subgraphs Involving Forbidden Subgraphs. [Internet] [Doctoral dissertation]. Georgia State University; 2016. [cited 2019 Dec 08]. Available from: https://scholarworks.gsu.edu/math_diss/29.

Council of Science Editors:

Yang P. Spanning Halin Subgraphs Involving Forbidden Subgraphs. [Doctoral Dissertation]. Georgia State University; 2016. Available from: https://scholarworks.gsu.edu/math_diss/29


University of Ottawa

4. Legault, Philippe. Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem .

Degree: 2017, University of Ottawa

 Given a complete graph K_n = (V,E) with non-negative edge costs c ∈ R^E, the problem multi-2EC_cost is that of finding a 2-edge connected spanning… (more)

Subjects/Keywords: Minimum cost 2-edge connected spanning subgraph problem; Minimum size 2-edge connected spanning subgraph problem; Approximation algorithm; Integrality gap; Cubic graphs; Half-integer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Legault, P. (2017). Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/36202

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

Legault, Philippe. “Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem .” 2017. Thesis, University of Ottawa. Accessed December 08, 2019. http://hdl.handle.net/10393/36202.

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

MLA Handbook (7th Edition):

Legault, Philippe. “Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem .” 2017. Web. 08 Dec 2019.

Vancouver:

Legault P. Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem . [Internet] [Thesis]. University of Ottawa; 2017. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10393/36202.

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

Council of Science Editors:

Legault P. Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem . [Thesis]. University of Ottawa; 2017. Available from: http://hdl.handle.net/10393/36202

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


University of Newcastle

5. Pérez-Rosés, Hebert. Large networks bounded in degree and diameter.

Degree: PhD, 2012, University of Newcastle

Research Doctorate - Doctor of Philosophy (PhD)

In the design of large interconnection networks several (and sometimes conflicting) factors come into play. Two of the… (more)

Subjects/Keywords: network design; Degree-Diameter Problem; mesh; hypercube; honeycomb; Degree-Diameter Subgraph Problem; Maximum Degree-and-Diameter Bounded Subgraph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pérez-Rosés, H. (2012). Large networks bounded in degree and diameter. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/933140

Chicago Manual of Style (16th Edition):

Pérez-Rosés, Hebert. “Large networks bounded in degree and diameter.” 2012. Doctoral Dissertation, University of Newcastle. Accessed December 08, 2019. http://hdl.handle.net/1959.13/933140.

MLA Handbook (7th Edition):

Pérez-Rosés, Hebert. “Large networks bounded in degree and diameter.” 2012. Web. 08 Dec 2019.

Vancouver:

Pérez-Rosés H. Large networks bounded in degree and diameter. [Internet] [Doctoral dissertation]. University of Newcastle; 2012. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1959.13/933140.

Council of Science Editors:

Pérez-Rosés H. Large networks bounded in degree and diameter. [Doctoral Dissertation]. University of Newcastle; 2012. Available from: http://hdl.handle.net/1959.13/933140


University of Illinois – Urbana-Champaign

6. Burle, Sai Kiran. Optimal heavy-traffic queue length scaling in an incompletely saturated switch.

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

 We consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet… (more)

Subjects/Keywords: Switch; Maximum weight scheduling; Data center; MaxWeight

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Burle, S. K. (2017). Optimal heavy-traffic queue length scaling in an incompletely saturated switch. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97777

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

Burle, Sai Kiran. “Optimal heavy-traffic queue length scaling in an incompletely saturated switch.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed December 08, 2019. http://hdl.handle.net/2142/97777.

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

MLA Handbook (7th Edition):

Burle, Sai Kiran. “Optimal heavy-traffic queue length scaling in an incompletely saturated switch.” 2017. Web. 08 Dec 2019.

Vancouver:

Burle SK. Optimal heavy-traffic queue length scaling in an incompletely saturated switch. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/2142/97777.

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

Council of Science Editors:

Burle SK. Optimal heavy-traffic queue length scaling in an incompletely saturated switch. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97777

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

7. Dross, François. Vertex partition of sparse graphs : Partition des sommets de graphes peu denses.

Degree: Docteur es, Informatique, 2018, Montpellier

Le Théorème des Quatre Couleurs, conjecturé en 1852 et prouvé en 1976, est à l'origine de l'étude des partitions des sommets de graphes peu denses.… (more)

Subjects/Keywords: Sous-Graphe induit; Partition des sommets; Coloration impropre; Graphe planaire; Degré moyen maximum; Induced subgraph; Vertex partition; Improper coloring; Planar graph; Maximum average degree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dross, F. (2018). Vertex partition of sparse graphs : Partition des sommets de graphes peu denses. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2018MONTS011

Chicago Manual of Style (16th Edition):

Dross, François. “Vertex partition of sparse graphs : Partition des sommets de graphes peu denses.” 2018. Doctoral Dissertation, Montpellier. Accessed December 08, 2019. http://www.theses.fr/2018MONTS011.

MLA Handbook (7th Edition):

Dross, François. “Vertex partition of sparse graphs : Partition des sommets de graphes peu denses.” 2018. Web. 08 Dec 2019.

Vancouver:

Dross F. Vertex partition of sparse graphs : Partition des sommets de graphes peu denses. [Internet] [Doctoral dissertation]. Montpellier; 2018. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2018MONTS011.

Council of Science Editors:

Dross F. Vertex partition of sparse graphs : Partition des sommets de graphes peu denses. [Doctoral Dissertation]. Montpellier; 2018. Available from: http://www.theses.fr/2018MONTS011


NSYSU

8. Chung, Yi-cheng. Global Maximum Power Point Tracking by Using Short-Circuit Current for Serial Photovoltaic Panels.

Degree: Master, Electrical Engineering, 2016, NSYSU

 This thesis proposes a novel maximum power point tracking (MPPT) method for serially connected photovoltaic (PV) panels under partially shaded conditions. Experimental results indicate that… (more)

Subjects/Keywords: Short-circuit currents; Partially shaded condition; Serially connected photovoltaic (PV) panels; Maximum power point tracking (MPPT); Global maximum power point

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chung, Y. (2016). Global Maximum Power Point Tracking by Using Short-Circuit Current for Serial Photovoltaic Panels. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711116-221702

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

Chung, Yi-cheng. “Global Maximum Power Point Tracking by Using Short-Circuit Current for Serial Photovoltaic Panels.” 2016. Thesis, NSYSU. Accessed December 08, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711116-221702.

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

MLA Handbook (7th Edition):

Chung, Yi-cheng. “Global Maximum Power Point Tracking by Using Short-Circuit Current for Serial Photovoltaic Panels.” 2016. Web. 08 Dec 2019.

Vancouver:

Chung Y. Global Maximum Power Point Tracking by Using Short-Circuit Current for Serial Photovoltaic Panels. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Dec 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711116-221702.

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

Council of Science Editors:

Chung Y. Global Maximum Power Point Tracking by Using Short-Circuit Current for Serial Photovoltaic Panels. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711116-221702

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


NSYSU

9. Chen, Min-Rong. Maximum Power Tracking Control Applied to Grid-connected Wind Power System with Excitation Synchronous Generator.

Degree: Master, Electrical Engineering, 2013, NSYSU

 This thesis presents a novel structure of wind power system, which simplifies the framework and improves the efficiency of traditional wind power system. Comparing to… (more)

Subjects/Keywords: Grid-connected; Maximum Power Tracking Control; Excitation Synchronous Generators; Wind Power System

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, M. (2013). Maximum Power Tracking Control Applied to Grid-connected Wind Power System with Excitation Synchronous Generator. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705113-115108

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

Chen, Min-Rong. “Maximum Power Tracking Control Applied to Grid-connected Wind Power System with Excitation Synchronous Generator.” 2013. Thesis, NSYSU. Accessed December 08, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705113-115108.

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

MLA Handbook (7th Edition):

Chen, Min-Rong. “Maximum Power Tracking Control Applied to Grid-connected Wind Power System with Excitation Synchronous Generator.” 2013. Web. 08 Dec 2019.

Vancouver:

Chen M. Maximum Power Tracking Control Applied to Grid-connected Wind Power System with Excitation Synchronous Generator. [Internet] [Thesis]. NSYSU; 2013. [cited 2019 Dec 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705113-115108.

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

Council of Science Editors:

Chen M. Maximum Power Tracking Control Applied to Grid-connected Wind Power System with Excitation Synchronous Generator. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705113-115108

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

10. Maxwell, Sean T. Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph.

Degree: MSs, Systems Biology and Bioinformatics, 2014, Case Western Reserve University

 In this work we investigate the problem of efficiently enumerating all connected induced subgraphs of an undirected graph. We show that the redundant computationsin a… (more)

Subjects/Keywords: Bioinformatics; Computer Science; connected induced subgraph; subgraph enumeration; hereditary property; branch and bound; depth first search; enumeration tree

…A set of vertices S ⊆ V that induce a connected subgraph in G Tree T N B n r Tree… …connected subgraph of the interaction network is much smaller. We seek to further reduce the… …bound enumeration of connected induced subgraphs. Subgraph enumeration is a problem that… …whereas connected induced subgraph enumeration aims to generate vertex sets that satisfy the… …connected to every other node of the subgraph. More specifically, investigators commonly wish to… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maxwell, S. T. (2014). Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph. (Masters Thesis). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1386363081

Chicago Manual of Style (16th Edition):

Maxwell, Sean T. “Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph.” 2014. Masters Thesis, Case Western Reserve University. Accessed December 08, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1386363081.

MLA Handbook (7th Edition):

Maxwell, Sean T. “Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph.” 2014. Web. 08 Dec 2019.

Vancouver:

Maxwell ST. Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph. [Internet] [Masters thesis]. Case Western Reserve University; 2014. [cited 2019 Dec 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1386363081.

Council of Science Editors:

Maxwell ST. Efficient Enumeration of all Connected Induced Subgraphs of a Large Undirected Graph. [Masters Thesis]. Case Western Reserve University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1386363081


University of Kansas

11. Abushaiba, Ali. Extremum Seeking Maximum Power Point Tracking for a Stand-Alone and a Grid-Connected Photovoltaic Systems.

Degree: PhD, Electrical Engineering & Computer Science, 2018, University of Kansas

 Energy harvesting from solar sources in an attempt to increase efficiency has sparked interest in many communities to develop more energy harvesting applications for renewable… (more)

Subjects/Keywords: Electrical engineering; Extremum Seeking; Grid-Connected; Maximum Power Point Tracking; Model Predictive Control; Photovoltaic Systems; Stand-Alone

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abushaiba, A. (2018). Extremum Seeking Maximum Power Point Tracking for a Stand-Alone and a Grid-Connected Photovoltaic Systems. (Doctoral Dissertation). University of Kansas. Retrieved from http://hdl.handle.net/1808/27584

Chicago Manual of Style (16th Edition):

Abushaiba, Ali. “Extremum Seeking Maximum Power Point Tracking for a Stand-Alone and a Grid-Connected Photovoltaic Systems.” 2018. Doctoral Dissertation, University of Kansas. Accessed December 08, 2019. http://hdl.handle.net/1808/27584.

MLA Handbook (7th Edition):

Abushaiba, Ali. “Extremum Seeking Maximum Power Point Tracking for a Stand-Alone and a Grid-Connected Photovoltaic Systems.” 2018. Web. 08 Dec 2019.

Vancouver:

Abushaiba A. Extremum Seeking Maximum Power Point Tracking for a Stand-Alone and a Grid-Connected Photovoltaic Systems. [Internet] [Doctoral dissertation]. University of Kansas; 2018. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/1808/27584.

Council of Science Editors:

Abushaiba A. Extremum Seeking Maximum Power Point Tracking for a Stand-Alone and a Grid-Connected Photovoltaic Systems. [Doctoral Dissertation]. University of Kansas; 2018. Available from: http://hdl.handle.net/1808/27584


Université de Bordeaux I

12. Hauss, Grégory. Microtomographie X de matériaux à comportement pseudo-fragile : Identification du réseau de fissures : X-ray microtomography of materials to brittle-like behavior : Identification of the crack network.

Degree: Docteur es, Physico-Chimie de la Matière Condensée, 2012, Université de Bordeaux I

L'étude de l'endommagement des matériaux à comportement pseudo-fragile fait l'objet denombreuses études et la caractérisation du réseau de fissures constitue une étape nécessairepour une meilleure… (more)

Subjects/Keywords: Microtomographie X; Béton; Réseau de fissures; Compression in situ; Maximum d’entropie; Composante connexe; X-ray microtomography; Concrete; Cracks network; In situ compression test; Maximum entropy; Connected component; 540; 620.11

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hauss, G. (2012). Microtomographie X de matériaux à comportement pseudo-fragile : Identification du réseau de fissures : X-ray microtomography of materials to brittle-like behavior : Identification of the crack network. (Doctoral Dissertation). Université de Bordeaux I. Retrieved from http://www.theses.fr/2012BOR14654

Chicago Manual of Style (16th Edition):

Hauss, Grégory. “Microtomographie X de matériaux à comportement pseudo-fragile : Identification du réseau de fissures : X-ray microtomography of materials to brittle-like behavior : Identification of the crack network.” 2012. Doctoral Dissertation, Université de Bordeaux I. Accessed December 08, 2019. http://www.theses.fr/2012BOR14654.

MLA Handbook (7th Edition):

Hauss, Grégory. “Microtomographie X de matériaux à comportement pseudo-fragile : Identification du réseau de fissures : X-ray microtomography of materials to brittle-like behavior : Identification of the crack network.” 2012. Web. 08 Dec 2019.

Vancouver:

Hauss G. Microtomographie X de matériaux à comportement pseudo-fragile : Identification du réseau de fissures : X-ray microtomography of materials to brittle-like behavior : Identification of the crack network. [Internet] [Doctoral dissertation]. Université de Bordeaux I; 2012. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2012BOR14654.

Council of Science Editors:

Hauss G. Microtomographie X de matériaux à comportement pseudo-fragile : Identification du réseau de fissures : X-ray microtomography of materials to brittle-like behavior : Identification of the crack network. [Doctoral Dissertation]. Université de Bordeaux I; 2012. Available from: http://www.theses.fr/2012BOR14654

13. Sun, Yu. Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem .

Degree: 2013, University of Ottawa

 A graph is said to be 2-edge-connected if it remains connected after the deletion of any single edge. Given an unweighted bridgeless graph G with… (more)

Subjects/Keywords: minimum size 2-edge-connected spanning subgraph problem; 2-edge-connected; approximation algorithms; approximation ratio; integrality gap

…minimum size 2-edge-connected spanning subgraph problem C2EC minimum size 2-edge-connected… …bridgeless graph G = (V, E), the minimum size 2-edge-connected spanning subgraph problem… …x28;henceforth 2EC ) consists of finding a 2-edge-connected spanning subgraph 2 H of… …exists one, a Hamilton cycle9 of G is naturally a minimum 2-edge-connected spanning subgraph of… …x29; on n vertices, a 2-edge-connected spanning subgraph of G can be found based on a… 

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

Sun, Y. (2013). Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/24198

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

Sun, Yu. “Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem .” 2013. Thesis, University of Ottawa. Accessed December 08, 2019. http://hdl.handle.net/10393/24198.

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

MLA Handbook (7th Edition):

Sun, Yu. “Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem .” 2013. Web. 08 Dec 2019.

Vancouver:

Sun Y. Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem . [Internet] [Thesis]. University of Ottawa; 2013. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10393/24198.

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

Council of Science Editors:

Sun Y. Theoretical and Experimental Studies on the Minimum Size 2-edge-connected Spanning Subgraph Problem . [Thesis]. University of Ottawa; 2013. Available from: http://hdl.handle.net/10393/24198

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

14. Fu, Yao. Applications of Circulations and Removable Pairings to TSP and 2ECSS .

Degree: 2014, University of Ottawa

 In this thesis we focus on two NP-hard and intensively studied problems: The travelling salesman problem (TSP), which aims to find a minimum cost tour… (more)

Subjects/Keywords: travelling salesman problem; approximation algorithm; minimum 2-edge-connected subgraph problem; circulations; T-joins; integrality gap

…called the 2-edge-connected spanning subgraph (2ECSS)7 problem. The problem is to… …find a 2-edge-connected spanning subgraph of a given graph while minimizing the number of… …fewest links, the minimum cost 2-edge-connected spanning subgraph is naturally a good choice… …edge-connected spanning subgraph − k−2 . This improves Huh’s [Huh04] with the… …19 2.3 Graphs illustrating (a) a maximum matching, and (b) a perfect… 

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

Fu, Y. (2014). Applications of Circulations and Removable Pairings to TSP and 2ECSS . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/31078

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

Fu, Yao. “Applications of Circulations and Removable Pairings to TSP and 2ECSS .” 2014. Thesis, University of Ottawa. Accessed December 08, 2019. http://hdl.handle.net/10393/31078.

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

MLA Handbook (7th Edition):

Fu, Yao. “Applications of Circulations and Removable Pairings to TSP and 2ECSS .” 2014. Web. 08 Dec 2019.

Vancouver:

Fu Y. Applications of Circulations and Removable Pairings to TSP and 2ECSS . [Internet] [Thesis]. University of Ottawa; 2014. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10393/31078.

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

Council of Science Editors:

Fu Y. Applications of Circulations and Removable Pairings to TSP and 2ECSS . [Thesis]. University of Ottawa; 2014. Available from: http://hdl.handle.net/10393/31078

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


Linnaeus University

15. Zheng, Rongpeng. An FPGA Based MPPT and Monitoring System : suitable for a photovoltaic based microgrid.

Degree: Physics and Electrical Engineering, 2019, Linnaeus University

  Microgrids containing photovoltaic (PV) cells and wind power gain more and more interest. These microgrids may work in stand-alone mode ("islanding") or be conncted… (more)

Subjects/Keywords: Microgrids; Monitoring System; Maximum Power Point Tracking (MPPT); Stand-alone Mode; Grid-connected Mode; FPGA; Verilog HDL.; Electrical Engineering, Electronic Engineering, Information Engineering; Elektroteknik och elektronik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zheng, R. (2019). An FPGA Based MPPT and Monitoring System : suitable for a photovoltaic based microgrid. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85558

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

Zheng, Rongpeng. “An FPGA Based MPPT and Monitoring System : suitable for a photovoltaic based microgrid.” 2019. Thesis, Linnaeus University. Accessed December 08, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85558.

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

MLA Handbook (7th Edition):

Zheng, Rongpeng. “An FPGA Based MPPT and Monitoring System : suitable for a photovoltaic based microgrid.” 2019. Web. 08 Dec 2019.

Vancouver:

Zheng R. An FPGA Based MPPT and Monitoring System : suitable for a photovoltaic based microgrid. [Internet] [Thesis]. Linnaeus University; 2019. [cited 2019 Dec 08]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85558.

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

Council of Science Editors:

Zheng R. An FPGA Based MPPT and Monitoring System : suitable for a photovoltaic based microgrid. [Thesis]. Linnaeus University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85558

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


Princeton University

16. Naamad, Yonatan. Hardness from Densest Subgraph Conjectures .

Degree: PhD, 2017, Princeton University

 Karp's seminal paper on NP-Completeness provided computer scientists with a toolkit for showing computational hardness, conditioned on a complexity theoretic conjecture, for a wide variety… (more)

Subjects/Keywords: Algorithms; Approximation; Densest Subgraph; Hardness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naamad, Y. (2017). Hardness from Densest Subgraph Conjectures . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01f7623g24h

Chicago Manual of Style (16th Edition):

Naamad, Yonatan. “Hardness from Densest Subgraph Conjectures .” 2017. Doctoral Dissertation, Princeton University. Accessed December 08, 2019. http://arks.princeton.edu/ark:/88435/dsp01f7623g24h.

MLA Handbook (7th Edition):

Naamad, Yonatan. “Hardness from Densest Subgraph Conjectures .” 2017. Web. 08 Dec 2019.

Vancouver:

Naamad Y. Hardness from Densest Subgraph Conjectures . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2019 Dec 08]. Available from: http://arks.princeton.edu/ark:/88435/dsp01f7623g24h.

Council of Science Editors:

Naamad Y. Hardness from Densest Subgraph Conjectures . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp01f7623g24h


Princeton University

17. Spirkl, Sophie Theresa. Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs .

Degree: PhD, 2018, Princeton University

 The Gyarfás-Sumner conjecture [29, 42] states that for every tree T there is a function f such that for every graph G with no induced… (more)

Subjects/Keywords: coloring; graph theory; induced subgraph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Spirkl, S. T. (2018). Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01zw12z7994

Chicago Manual of Style (16th Edition):

Spirkl, Sophie Theresa. “Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs .” 2018. Doctoral Dissertation, Princeton University. Accessed December 08, 2019. http://arks.princeton.edu/ark:/88435/dsp01zw12z7994.

MLA Handbook (7th Edition):

Spirkl, Sophie Theresa. “Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs .” 2018. Web. 08 Dec 2019.

Vancouver:

Spirkl ST. Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Dec 08]. Available from: http://arks.princeton.edu/ark:/88435/dsp01zw12z7994.

Council of Science Editors:

Spirkl ST. Cliques, stable sets, and coloring in graphs with forbidden induced subgraphs . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp01zw12z7994

18. Araujo Tavares, Wladimir. Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum.

Degree: Docteur es, Informatique, 2016, Avignon; Universidade federal do Ceará

Dans ce travail, nous présentons trois nouveaux algorithmes pour le problème de la clique de poids maximum. Les trois algorithmes dépendent d'un ordre initial des… (more)

Subjects/Keywords: Clique de poids maximum; Coloration pondérée; Séparation et évaluation; Poupées russes; Resolution search; Maximum weight clique problem; Weighted integer coloring heuristic; Branch and Bound; Russian dolls; Resolution search; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Araujo Tavares, W. (2016). Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum. (Doctoral Dissertation). Avignon; Universidade federal do Ceará. Retrieved from http://www.theses.fr/2016AVIG0211

Chicago Manual of Style (16th Edition):

Araujo Tavares, Wladimir. “Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum.” 2016. Doctoral Dissertation, Avignon; Universidade federal do Ceará. Accessed December 08, 2019. http://www.theses.fr/2016AVIG0211.

MLA Handbook (7th Edition):

Araujo Tavares, Wladimir. “Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum.” 2016. Web. 08 Dec 2019.

Vancouver:

Araujo Tavares W. Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum. [Internet] [Doctoral dissertation]. Avignon; Universidade federal do Ceará; 2016. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2016AVIG0211.

Council of Science Editors:

Araujo Tavares W. Algoritmos exatos para problema da clique maxima ponderada : Algorithmes pour le problème de la clique de poids maximum. [Doctoral Dissertation]. Avignon; Universidade federal do Ceará; 2016. Available from: http://www.theses.fr/2016AVIG0211


Université Paris-Sud – Paris XI

19. Montuelle, Lucie. Inégalités d'oracle et mélanges : Oracle inequalities and mixtures.

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

Ce manuscrit se concentre sur deux problèmes d'estimation de fonction. Pour chacun, une garantie non asymptotique des performances de l'estimateur proposé est fournie par une… (more)

Subjects/Keywords: Inégalité d'oracle; Sélection de modèle; Pénalisation; Poids exponentiels; Apprentissage; Agrégation; Modèles de mélange; Maximum de vraisemblance; Oracle inequality; Model selection; Penalization; Exponential weight; Learning; Aggregation; Mixture model; Maximum likelihood

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Montuelle, L. (2014). Inégalités d'oracle et mélanges : Oracle inequalities and mixtures. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2014PA112364

Chicago Manual of Style (16th Edition):

Montuelle, Lucie. “Inégalités d'oracle et mélanges : Oracle inequalities and mixtures.” 2014. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed December 08, 2019. http://www.theses.fr/2014PA112364.

MLA Handbook (7th Edition):

Montuelle, Lucie. “Inégalités d'oracle et mélanges : Oracle inequalities and mixtures.” 2014. Web. 08 Dec 2019.

Vancouver:

Montuelle L. Inégalités d'oracle et mélanges : Oracle inequalities and mixtures. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2014. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2014PA112364.

Council of Science Editors:

Montuelle L. Inégalités d'oracle et mélanges : Oracle inequalities and mixtures. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2014. Available from: http://www.theses.fr/2014PA112364


NSYSU

20. Chien, Tzu-chieh. Construction Smart Beta Style Indexes - with Application in Taiwan Market.

Degree: Master, Finance, 2016, NSYSU

 Smart beta is popular concept to used abroad to establish passive portfolios. At present, there are more than 700 exchange traded products (ETP) all over… (more)

Subjects/Keywords: Minimum-Variance Portfolio; Equal Risk Contribution Portfolio; Smart Beta; Style Index; Maximum Sharpe Ratio Portfolio; Equal Weight Portfolio

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chien, T. (2016). Construction Smart Beta Style Indexes - with Application in Taiwan Market. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0529116-103551

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

Chien, Tzu-chieh. “Construction Smart Beta Style Indexes - with Application in Taiwan Market.” 2016. Thesis, NSYSU. Accessed December 08, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0529116-103551.

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

MLA Handbook (7th Edition):

Chien, Tzu-chieh. “Construction Smart Beta Style Indexes - with Application in Taiwan Market.” 2016. Web. 08 Dec 2019.

Vancouver:

Chien T. Construction Smart Beta Style Indexes - with Application in Taiwan Market. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Dec 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0529116-103551.

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

Council of Science Editors:

Chien T. Construction Smart Beta Style Indexes - with Application in Taiwan Market. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0529116-103551

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


Penn State University

21. Palahan, Sirinda. A Framework for Mining Significant Subgraphs and Its Application in Malware Analysis.

Degree: PhD, Computer Science and Engineering, 2014, Penn State University

 The growth of graph data has encouraged research in graph mining algorithms, especially subgraph pattern mining from graph databases. Discovered patterns could help researchers understand… (more)

Subjects/Keywords: Significant subgraph; subgraph mining; malware behavior; malware detection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Palahan, S. (2014). A Framework for Mining Significant Subgraphs and Its Application in Malware Analysis. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/21698

Chicago Manual of Style (16th Edition):

Palahan, Sirinda. “A Framework for Mining Significant Subgraphs and Its Application in Malware Analysis.” 2014. Doctoral Dissertation, Penn State University. Accessed December 08, 2019. https://etda.libraries.psu.edu/catalog/21698.

MLA Handbook (7th Edition):

Palahan, Sirinda. “A Framework for Mining Significant Subgraphs and Its Application in Malware Analysis.” 2014. Web. 08 Dec 2019.

Vancouver:

Palahan S. A Framework for Mining Significant Subgraphs and Its Application in Malware Analysis. [Internet] [Doctoral dissertation]. Penn State University; 2014. [cited 2019 Dec 08]. Available from: https://etda.libraries.psu.edu/catalog/21698.

Council of Science Editors:

Palahan S. A Framework for Mining Significant Subgraphs and Its Application in Malware Analysis. [Doctoral Dissertation]. Penn State University; 2014. Available from: https://etda.libraries.psu.edu/catalog/21698


NSYSU

22. Chiang, Yu-Chin. The Graphs induced by the Noncommutativity of Groups.

Degree: Master, Applied Mathematics, 2007, NSYSU

We consider the graphs induced by the noncommutativity of groups and discuss some properties of the largest complete subgraphs of these graphs. Advisors/Committee Members: Xuding Zhu (chair), Tsai-Lien Wong (committee member), Li-Da Tong (chair).

Subjects/Keywords: Noncommutativity; Complete subgraph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiang, Y. (2007). The Graphs induced by the Noncommutativity of Groups. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752

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

Chiang, Yu-Chin. “The Graphs induced by the Noncommutativity of Groups.” 2007. Thesis, NSYSU. Accessed December 08, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752.

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

MLA Handbook (7th Edition):

Chiang, Yu-Chin. “The Graphs induced by the Noncommutativity of Groups.” 2007. Web. 08 Dec 2019.

Vancouver:

Chiang Y. The Graphs induced by the Noncommutativity of Groups. [Internet] [Thesis]. NSYSU; 2007. [cited 2019 Dec 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752.

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

Council of Science Editors:

Chiang Y. The Graphs induced by the Noncommutativity of Groups. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0320107-102752

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


Case Western Reserve University

23. Zhang, Shijie. Index-based Graph Querying and Matching in Large Graphs.

Degree: PhD, EECS - Computer and Information Sciences, 2010, Case Western Reserve University

 Currently, a huge amount data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The size of an application graph… (more)

Subjects/Keywords: Computer Science; graph indexing matching subgraph serach

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, S. (2010). Index-based Graph Querying and Matching in Large Graphs. (Doctoral Dissertation). Case Western Reserve University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028

Chicago Manual of Style (16th Edition):

Zhang, Shijie. “Index-based Graph Querying and Matching in Large Graphs.” 2010. Doctoral Dissertation, Case Western Reserve University. Accessed December 08, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028.

MLA Handbook (7th Edition):

Zhang, Shijie. “Index-based Graph Querying and Matching in Large Graphs.” 2010. Web. 08 Dec 2019.

Vancouver:

Zhang S. Index-based Graph Querying and Matching in Large Graphs. [Internet] [Doctoral dissertation]. Case Western Reserve University; 2010. [cited 2019 Dec 08]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028.

Council of Science Editors:

Zhang S. Index-based Graph Querying and Matching in Large Graphs. [Doctoral Dissertation]. Case Western Reserve University; 2010. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028

24. Jain, Ayushi. Parallel algorithms for subgraph pattern matching.

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

 Due to the growing importance of Big Data, graphs are becoming huge in size and are rapidly getting too large for conventional computer approaches. Graph… (more)

Subjects/Keywords: subgraph isomorphism

…immediate applications like subgraph pattern matching [1], maximum common subgraph [… …a data graph leads to NP-Complete problem [2] which is known as subgraph… …machines typically consists of set of processors and memory connected by some high speed network… …shortest path can be employed to compute the paths in parallel, thereby achieving maximum… …system will observe performance degradation. 3. Load Balancing – To achieve maximum parallelism… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jain, A. (2014). Parallel algorithms for subgraph pattern matching. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms

Chicago Manual of Style (16th Edition):

Jain, Ayushi. “Parallel algorithms for subgraph pattern matching.” 2014. Masters Thesis, University of Georgia. Accessed December 08, 2019. http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms.

MLA Handbook (7th Edition):

Jain, Ayushi. “Parallel algorithms for subgraph pattern matching.” 2014. Web. 08 Dec 2019.

Vancouver:

Jain A. Parallel algorithms for subgraph pattern matching. [Internet] [Masters thesis]. University of Georgia; 2014. [cited 2019 Dec 08]. Available from: http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms.

Council of Science Editors:

Jain A. Parallel algorithms for subgraph pattern matching. [Masters Thesis]. University of Georgia; 2014. Available from: http://purl.galileo.usg.edu/uga_etd/jain_ayushi_201408_ms

25. El achkar, Maria. Contribution au Dimensionnement et à la Commande d’un Générateur de type Cascade de Machines Asynchrones à Double Alimentation : Contribution to the Sizing and Control of the Cascaded Doubly Fed Induction Generator.

Degree: Docteur es, Génie électrique et électronique - Cergy, 2016, Cergy-Pontoise

Le travail présenté dans cette thèse est une contribution au dimensionnement et à la commande d’un générateur de type Cascade de Machines Asynchrones à Double… (more)

Subjects/Keywords: Cascade de machines asynchrones doublement alimentées (CMADA); Domaine de puissances active-Reactive; Extraction maximale de puissance; Eolienne connectée au réseau; Application isolée; Charge déséquilibrée; Cascaded doubly fed induction machine (CDFIM); Active-Reactive power domain; Maximum power point tracking; Grid-Connected wind turbine; Standalone application; Unbalanced load

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

El achkar, M. (2016). Contribution au Dimensionnement et à la Commande d’un Générateur de type Cascade de Machines Asynchrones à Double Alimentation : Contribution to the Sizing and Control of the Cascaded Doubly Fed Induction Generator. (Doctoral Dissertation). Cergy-Pontoise. Retrieved from http://www.theses.fr/2016CERG0814

Chicago Manual of Style (16th Edition):

El achkar, Maria. “Contribution au Dimensionnement et à la Commande d’un Générateur de type Cascade de Machines Asynchrones à Double Alimentation : Contribution to the Sizing and Control of the Cascaded Doubly Fed Induction Generator.” 2016. Doctoral Dissertation, Cergy-Pontoise. Accessed December 08, 2019. http://www.theses.fr/2016CERG0814.

MLA Handbook (7th Edition):

El achkar, Maria. “Contribution au Dimensionnement et à la Commande d’un Générateur de type Cascade de Machines Asynchrones à Double Alimentation : Contribution to the Sizing and Control of the Cascaded Doubly Fed Induction Generator.” 2016. Web. 08 Dec 2019.

Vancouver:

El achkar M. Contribution au Dimensionnement et à la Commande d’un Générateur de type Cascade de Machines Asynchrones à Double Alimentation : Contribution to the Sizing and Control of the Cascaded Doubly Fed Induction Generator. [Internet] [Doctoral dissertation]. Cergy-Pontoise; 2016. [cited 2019 Dec 08]. Available from: http://www.theses.fr/2016CERG0814.

Council of Science Editors:

El achkar M. Contribution au Dimensionnement et à la Commande d’un Générateur de type Cascade de Machines Asynchrones à Double Alimentation : Contribution to the Sizing and Control of the Cascaded Doubly Fed Induction Generator. [Doctoral Dissertation]. Cergy-Pontoise; 2016. Available from: http://www.theses.fr/2016CERG0814

26. Oliveira, Elsa. Problemática associada à utilização de diferentes tipos de mochila para transporte de material escolar.

Degree: 2013, Instituto Politécnico do Porto

O transporte de cargas é uma tarefa comum para crianças, adolescentes e adultos, pela necessidade de transferência diária de objetos pessoais, livros e artigos de… (more)

Subjects/Keywords: Transporte de mochila; Psicofísico; Peso máximo aceitável; Índice de esforço percebido; Dor lombar; Backpack transport; Psychophysical; Maximum acceptable weight; Perceived effort index; Back pain

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oliveira, E. (2013). Problemática associada à utilização de diferentes tipos de mochila para transporte de material escolar. (Thesis). Instituto Politécnico do Porto. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4759

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

Oliveira, Elsa. “Problemática associada à utilização de diferentes tipos de mochila para transporte de material escolar.” 2013. Thesis, Instituto Politécnico do Porto. Accessed December 08, 2019. https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4759.

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

MLA Handbook (7th Edition):

Oliveira, Elsa. “Problemática associada à utilização de diferentes tipos de mochila para transporte de material escolar.” 2013. Web. 08 Dec 2019.

Vancouver:

Oliveira E. Problemática associada à utilização de diferentes tipos de mochila para transporte de material escolar. [Internet] [Thesis]. Instituto Politécnico do Porto; 2013. [cited 2019 Dec 08]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4759.

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

Council of Science Editors:

Oliveira E. Problemática associada à utilização de diferentes tipos de mochila para transporte de material escolar. [Thesis]. Instituto Politécnico do Porto; 2013. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/4759

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


Brno University of Technology

27. Handová, Jitka. Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a Rakouskem, Německem, státy Beneluxu a Velkou Británií .

Degree: 2011, Brno University of Technology

 Predložená diplomová práce je zamerena na vyhodnocení legislativních predpisu pro speciální silnicní prepravu mezi Ceskou republikou a vybranými zememi Evropské unie. Pojem speciální preprava v… (more)

Subjects/Keywords: Nadrozmerná a nadmerná preprava; nadrozmerný náklad; limitní rozmery a hmotnosti; legislativní predpisy; potrebné dokumenty; bezpecnost.; Oversize transport; oversize load; maximum dimensions and weight; legislative provisions; necessary documents; security.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Handová, J. (2011). Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a Rakouskem, Německem, státy Beneluxu a Velkou Británií . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/63921

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

Handová, Jitka. “Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a Rakouskem, Německem, státy Beneluxu a Velkou Británií .” 2011. Thesis, Brno University of Technology. Accessed December 08, 2019. http://hdl.handle.net/11012/63921.

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

MLA Handbook (7th Edition):

Handová, Jitka. “Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a Rakouskem, Německem, státy Beneluxu a Velkou Británií .” 2011. Web. 08 Dec 2019.

Vancouver:

Handová J. Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a Rakouskem, Německem, státy Beneluxu a Velkou Británií . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/11012/63921.

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

Council of Science Editors:

Handová J. Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a Rakouskem, Německem, státy Beneluxu a Velkou Británií . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/63921

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


Brno University of Technology

28. Koryťák, Antonín. Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a postsovětskými zeměmi .

Degree: 2010, Brno University of Technology

 Tématem této práce, je problematika mezinárodní dopravy, při uskutečňování přeprav nákladů, jejichž rozměry a hmotnosti převyšují stanovenou maximální hodnotu. Důraz je kladen hlavně na bezpečnost… (more)

Subjects/Keywords: limitní rozměry a hmotnosti; přepravy nadrozměrných nákladů; mezinárodní doprava; český dopravce; legislativní předpisy; maximum dimensions and weight; transportation of oversized cargo; International transport; Czech carrier; legislative provisions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koryťák, A. (2010). Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a postsovětskými zeměmi . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/15634

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

Koryťák, Antonín. “Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a postsovětskými zeměmi .” 2010. Thesis, Brno University of Technology. Accessed December 08, 2019. http://hdl.handle.net/11012/15634.

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

MLA Handbook (7th Edition):

Koryťák, Antonín. “Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a postsovětskými zeměmi .” 2010. Web. 08 Dec 2019.

Vancouver:

Koryťák A. Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a postsovětskými zeměmi . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/11012/15634.

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

Council of Science Editors:

Koryťák A. Vyhodnocení legislativních předpisů pro speciální silniční přepravu mezi Českou republikou a postsovětskými zeměmi . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/15634

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


Delft University of Technology

29. Thippur Shivamurthy, H. Wideband, Wide-Scan Planar Connected Slot Array Enhanced with Artificial Dielectrics:.

Degree: 2014, Delft University of Technology

 In this thesis, the design of planar connected array of slots loaded with artificial dielectric layers (ADLs) is proposed to achieve wideband and wide-scan capabilities.… (more)

Subjects/Keywords: ADL; connected array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thippur Shivamurthy, H. (2014). Wideband, Wide-Scan Planar Connected Slot Array Enhanced with Artificial Dielectrics:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:e6daada3-8039-49f9-8e51-73d54d1a914c

Chicago Manual of Style (16th Edition):

Thippur Shivamurthy, H. “Wideband, Wide-Scan Planar Connected Slot Array Enhanced with Artificial Dielectrics:.” 2014. Masters Thesis, Delft University of Technology. Accessed December 08, 2019. http://resolver.tudelft.nl/uuid:e6daada3-8039-49f9-8e51-73d54d1a914c.

MLA Handbook (7th Edition):

Thippur Shivamurthy, H. “Wideband, Wide-Scan Planar Connected Slot Array Enhanced with Artificial Dielectrics:.” 2014. Web. 08 Dec 2019.

Vancouver:

Thippur Shivamurthy H. Wideband, Wide-Scan Planar Connected Slot Array Enhanced with Artificial Dielectrics:. [Internet] [Masters thesis]. Delft University of Technology; 2014. [cited 2019 Dec 08]. Available from: http://resolver.tudelft.nl/uuid:e6daada3-8039-49f9-8e51-73d54d1a914c.

Council of Science Editors:

Thippur Shivamurthy H. Wideband, Wide-Scan Planar Connected Slot Array Enhanced with Artificial Dielectrics:. [Masters Thesis]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:e6daada3-8039-49f9-8e51-73d54d1a914c


University of Guelph

30. Xu, Tao. Multiple Instance Learning with Applications to Concept Learning, Classification and Structural Pattern Recognition .

Degree: 2017, University of Guelph

 In multiple instance learning (MIL), a class label is assigned to a collection (called bag) of instances instead of the individual instances. To learn concepts… (more)

Subjects/Keywords: multiple instance learning; concept learning; partial entropy; adaptive kernel diverse density estimate; common subgraph modeling; common random subgraph; Research Subject Categories

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, T. (2017). Multiple Instance Learning with Applications to Concept Learning, Classification and Structural Pattern Recognition . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10405

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

Xu, Tao. “Multiple Instance Learning with Applications to Concept Learning, Classification and Structural Pattern Recognition .” 2017. Thesis, University of Guelph. Accessed December 08, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10405.

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

MLA Handbook (7th Edition):

Xu, Tao. “Multiple Instance Learning with Applications to Concept Learning, Classification and Structural Pattern Recognition .” 2017. Web. 08 Dec 2019.

Vancouver:

Xu T. Multiple Instance Learning with Applications to Concept Learning, Classification and Structural Pattern Recognition . [Internet] [Thesis]. University of Guelph; 2017. [cited 2019 Dec 08]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10405.

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

Council of Science Editors:

Xu T. Multiple Instance Learning with Applications to Concept Learning, Classification and Structural Pattern Recognition . [Thesis]. University of Guelph; 2017. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/10405

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

[1] [2] [3] [4] [5] … [248]

.