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:(embedding algorithm). Showing records 1 – 12 of 12 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Brno University of Technology

1. Beránek, Michal. Posilované učení pro 3D hry: Reinforcement Learning for 3D Games.

Degree: 2019, Brno University of Technology

 Thesis deals with neural network learning on simple tasks in 3D shooter Doom, mediated by research platform ViZDoom. The main goal is to create an… (more)

Subjects/Keywords: neuronová síť; posilované učení; zpětnovazební učení; ViZDoom; přenesené učení; algoritmus Rainbow; PyTorch; Embedding vrstva; neural network; reinforcement learning; ViZDoom; transfer learning; Rainbow algorithm; PyTorch; Embedding layer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beránek, M. (2019). Posilované učení pro 3D hry: Reinforcement Learning for 3D Games. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/180305

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

Beránek, Michal. “Posilované učení pro 3D hry: Reinforcement Learning for 3D Games.” 2019. Thesis, Brno University of Technology. Accessed July 10, 2020. http://hdl.handle.net/11012/180305.

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

MLA Handbook (7th Edition):

Beránek, Michal. “Posilované učení pro 3D hry: Reinforcement Learning for 3D Games.” 2019. Web. 10 Jul 2020.

Vancouver:

Beránek M. Posilované učení pro 3D hry: Reinforcement Learning for 3D Games. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/11012/180305.

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

Council of Science Editors:

Beránek M. Posilované učení pro 3D hry: Reinforcement Learning for 3D Games. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/180305

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

2. Παπαδημητρίου, Αθανασία. Τεχνικές και κυκλώματα εμφώλευσης συνόλου δοκιμής για τον έλεγχο VLSI συστημάτων.

Degree: 2009, University of Patras

Η συνεχής μείωση των διαστάσεων των ψηφιακών κυκλωμάτων σε συνδυασμό με την ολοένα αυξανόμενη πολυπλοκότητά τους, έχει οδηγήσει στην απαίτηση για αξιοπιστία και συνεπώς στην… (more)

Subjects/Keywords: Πολυφασική αρχιτεκτονική; Εμφώλευση συνόλου δοκιμής; Αλγόριθμος ανατροφοδότησης; 621.392; Multiphase architecture; Test set embedding; Reseeding algorithm; RESPIN

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Παπαδημητρίου, . (2009). Τεχνικές και κυκλώματα εμφώλευσης συνόλου δοκιμής για τον έλεγχο VLSI συστημάτων. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/1689

Chicago Manual of Style (16th Edition):

Παπαδημητρίου, Αθανασία. “Τεχνικές και κυκλώματα εμφώλευσης συνόλου δοκιμής για τον έλεγχο VLSI συστημάτων.” 2009. Masters Thesis, University of Patras. Accessed July 10, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/1689.

MLA Handbook (7th Edition):

Παπαδημητρίου, Αθανασία. “Τεχνικές και κυκλώματα εμφώλευσης συνόλου δοκιμής για τον έλεγχο VLSI συστημάτων.” 2009. Web. 10 Jul 2020.

Vancouver:

Παπαδημητρίου . Τεχνικές και κυκλώματα εμφώλευσης συνόλου δοκιμής για τον έλεγχο VLSI συστημάτων. [Internet] [Masters thesis]. University of Patras; 2009. [cited 2020 Jul 10]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/1689.

Council of Science Editors:

Παπαδημητρίου . Τεχνικές και κυκλώματα εμφώλευσης συνόλου δοκιμής για τον έλεγχο VLSI συστημάτων. [Masters Thesis]. University of Patras; 2009. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/1689


Université de Lorraine

3. Bogso, Antoine Marie. Étude de peacocks sous l'hypothèse de monotonie conditionnelle et de positivité totale : A study of Peacocks under the assumptions of conditional monotonicity and total positivity.

Degree: Docteur es, Mathématiques, 2012, Université de Lorraine

Cette thèse porte sur les processus croissants pour l'ordre convexe que nous désignons sous le nom de peacocks. Un résultat remarquable dû à Kellerer stipule… (more)

Subjects/Keywords: Processus stochastiques; Processus de Markov; Mouvement brownien; Martingales; Peacocks; Monotonie conditionnelle; Positivité totale d'ordre 2; Problème de Skorokhod; Plongement d'Azéma-Yor; Plongement de Bertoin-Le Jan; Stochastic processes; Markov processes; Brownian motion; Martingales; Peacocks; Conditional monotonicity; Total positivity of order 2; Skorokhod embedding problem; Azéma-Yor algorithm for Skorokhod embedding; Bertoin-Le Jan solution for Skorokhod embedding; 519.2

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bogso, A. M. (2012). Étude de peacocks sous l'hypothèse de monotonie conditionnelle et de positivité totale : A study of Peacocks under the assumptions of conditional monotonicity and total positivity. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2012LORR0152

Chicago Manual of Style (16th Edition):

Bogso, Antoine Marie. “Étude de peacocks sous l'hypothèse de monotonie conditionnelle et de positivité totale : A study of Peacocks under the assumptions of conditional monotonicity and total positivity.” 2012. Doctoral Dissertation, Université de Lorraine. Accessed July 10, 2020. http://www.theses.fr/2012LORR0152.

MLA Handbook (7th Edition):

Bogso, Antoine Marie. “Étude de peacocks sous l'hypothèse de monotonie conditionnelle et de positivité totale : A study of Peacocks under the assumptions of conditional monotonicity and total positivity.” 2012. Web. 10 Jul 2020.

Vancouver:

Bogso AM. Étude de peacocks sous l'hypothèse de monotonie conditionnelle et de positivité totale : A study of Peacocks under the assumptions of conditional monotonicity and total positivity. [Internet] [Doctoral dissertation]. Université de Lorraine; 2012. [cited 2020 Jul 10]. Available from: http://www.theses.fr/2012LORR0152.

Council of Science Editors:

Bogso AM. Étude de peacocks sous l'hypothèse de monotonie conditionnelle et de positivité totale : A study of Peacocks under the assumptions of conditional monotonicity and total positivity. [Doctoral Dissertation]. Université de Lorraine; 2012. Available from: http://www.theses.fr/2012LORR0152


Brno University of Technology

4. Matula, Radek. Grafická reprezentace grafů: Graphics Graph Representation.

Degree: 2018, Brno University of Technology

 This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph… (more)

Subjects/Keywords: Teorie grafů; vrchol; hrana; ohodnocený graf; orientovaný graf; matice sousednosti; matice vzdáleností; matice incidence; Laplaceova matice; seznam sousedů; seznam vrcholů a hran; algoritmus High-Dimensional Embedding; algoritmus založený na silách; pružinový algoritmus; algoritmus Kamada-Kawai; algoritmus Fruchterman-Reingold; Graph theory; vertex; edge; edge-weighted graph; directed graph; adjacency matrix; distance matrix; incidence matrix; Laplacian matrix; list of neighbors; list of vertices and edges; mapping vertices on the circle; High-Dimensional Embedding algorithm; Force-based algorithm; Spring algorithm; Kamada-Kawai algorithm; Fruchterman-Reingold algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Matula, R. (2018). Grafická reprezentace grafů: Graphics Graph Representation. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53896

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

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Thesis, Brno University of Technology. Accessed July 10, 2020. http://hdl.handle.net/11012/53896.

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

MLA Handbook (7th Edition):

Matula, Radek. “Grafická reprezentace grafů: Graphics Graph Representation.” 2018. Web. 10 Jul 2020.

Vancouver:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/11012/53896.

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

Council of Science Editors:

Matula R. Grafická reprezentace grafů: Graphics Graph Representation. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53896

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

5. Catusse, Nicolas. Spanners pour des réseaux géométriques et plongements dans le plan : Il fragile filo della vita : l’opera poetica di Mario Luzi (1914-2005).

Degree: Docteur es, Informatique, 2011, Aix-Marseille 2

Dans cette thèse, nous nous intéressons à plusieurs problèmes liés à la conception de réseaux géométriques et aux plongements isométriques dans le plan.Nous commençons par… (more)

Subjects/Keywords: Géométrie algorithmique; Algorithme d'approximation; Distance; Plan normé; Plongement isométrique; Conception de réseau; Computational geometry; Approximation algorithm; Distance; Normed plan; Isometric embedding; Network design

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Catusse, N. (2011). Spanners pour des réseaux géométriques et plongements dans le plan : Il fragile filo della vita : l’opera poetica di Mario Luzi (1914-2005). (Doctoral Dissertation). Aix-Marseille 2. Retrieved from http://www.theses.fr/2011AIX22119

Chicago Manual of Style (16th Edition):

Catusse, Nicolas. “Spanners pour des réseaux géométriques et plongements dans le plan : Il fragile filo della vita : l’opera poetica di Mario Luzi (1914-2005).” 2011. Doctoral Dissertation, Aix-Marseille 2. Accessed July 10, 2020. http://www.theses.fr/2011AIX22119.

MLA Handbook (7th Edition):

Catusse, Nicolas. “Spanners pour des réseaux géométriques et plongements dans le plan : Il fragile filo della vita : l’opera poetica di Mario Luzi (1914-2005).” 2011. Web. 10 Jul 2020.

Vancouver:

Catusse N. Spanners pour des réseaux géométriques et plongements dans le plan : Il fragile filo della vita : l’opera poetica di Mario Luzi (1914-2005). [Internet] [Doctoral dissertation]. Aix-Marseille 2; 2011. [cited 2020 Jul 10]. Available from: http://www.theses.fr/2011AIX22119.

Council of Science Editors:

Catusse N. Spanners pour des réseaux géométriques et plongements dans le plan : Il fragile filo della vita : l’opera poetica di Mario Luzi (1914-2005). [Doctoral Dissertation]. Aix-Marseille 2; 2011. Available from: http://www.theses.fr/2011AIX22119

6. Carpenter, Timothy E. Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces.

Degree: PhD, Computer Science and Engineering, 2019, The Ohio State University

  We study the problem of finding a minimum-distortion embedding of the shortest path metric of a weighted or unweighted graph into a "simpler" metric… (more)

Subjects/Keywords: Computer Science; Mathematics; embedding; distortion; approximation; fixed parameter tractable; algorithm

…66 3.1 3.2 3.3 3.4 4. A FPT algorithm for embedding into 2.4.1 Definitions… …embeddings into general graphs . . . . . . . . . An approximation algorithm for embedding into… …FPT algorithm for embedding into arbitrary graphs . . . . . . 3.4.1 The CLUSTER algorithm… …135 vii List of Figures Figure 2.1 2.2 Page The approximation algorithm for embedding… …Embedding into low complexity graphs Most relevant to our approximation algorithm is the work of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carpenter, T. E. (2019). Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622

Chicago Manual of Style (16th Edition):

Carpenter, Timothy E. “Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces.” 2019. Doctoral Dissertation, The Ohio State University. Accessed July 10, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622.

MLA Handbook (7th Edition):

Carpenter, Timothy E. “Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces.” 2019. Web. 10 Jul 2020.

Vancouver:

Carpenter TE. Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces. [Internet] [Doctoral dissertation]. The Ohio State University; 2019. [cited 2020 Jul 10]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622.

Council of Science Editors:

Carpenter TE. Algorithms For Low-Distortion Embeddings Into Geometrically Restricted Spaces. [Doctoral Dissertation]. The Ohio State University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555337435997622


Arizona State University

7. Li, Yuting. Effect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem.

Degree: Electrical Engineering, 2015, Arizona State University

Subjects/Keywords: Electrical engineering; Condition number; Holomorphic Embedding; Numerical Performance; Power Flow Algorithm; Power System

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2015). Effect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem. (Masters Thesis). Arizona State University. Retrieved from http://repository.asu.edu/items/36427

Chicago Manual of Style (16th Edition):

Li, Yuting. “Effect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem.” 2015. Masters Thesis, Arizona State University. Accessed July 10, 2020. http://repository.asu.edu/items/36427.

MLA Handbook (7th Edition):

Li, Yuting. “Effect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem.” 2015. Web. 10 Jul 2020.

Vancouver:

Li Y. Effect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem. [Internet] [Masters thesis]. Arizona State University; 2015. [cited 2020 Jul 10]. Available from: http://repository.asu.edu/items/36427.

Council of Science Editors:

Li Y. Effect of Various Holomorphic Embeddings on Convergence Rate and Condition Number as Applied to the Power Flow Problem. [Masters Thesis]. Arizona State University; 2015. Available from: http://repository.asu.edu/items/36427

8. Zhao, Ruofei. Convergence and Consistency Results in Spectral Clustering and Gaussian Mixture Models.

Degree: PhD, Statistics, 2019, University of Michigan

 Clustering analysis is a popular technique in statistics and machine learning. Despite its wide use, certain theoretical properties of clustering algorithms are not well-understood. In… (more)

Subjects/Keywords: Gaussian mixture models; Spectral embedding; Spectral clustering; Expectation maximization algorithm; Statistics and Numeric Data; Science

…on the statistical convergence of the Expectation Maximization (EM) algorithm on… …clustering. In the second problem, we study the convergence behavior of the EM algorithm on… …algorithm converges locally to the global vii optimum of the log-likelihood. Further, we show… …the latent low-dimensional structure in the data. Spectral embedding gets its name from the… …normalized Laplacian embedding Φn : {xi }ni=1 → RK is given by Φn (xi )T = eTi… 

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

Zhao, R. (2019). Convergence and Consistency Results in Spectral Clustering and Gaussian Mixture Models. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/151538

Chicago Manual of Style (16th Edition):

Zhao, Ruofei. “Convergence and Consistency Results in Spectral Clustering and Gaussian Mixture Models.” 2019. Doctoral Dissertation, University of Michigan. Accessed July 10, 2020. http://hdl.handle.net/2027.42/151538.

MLA Handbook (7th Edition):

Zhao, Ruofei. “Convergence and Consistency Results in Spectral Clustering and Gaussian Mixture Models.” 2019. Web. 10 Jul 2020.

Vancouver:

Zhao R. Convergence and Consistency Results in Spectral Clustering and Gaussian Mixture Models. [Internet] [Doctoral dissertation]. University of Michigan; 2019. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/2027.42/151538.

Council of Science Editors:

Zhao R. Convergence and Consistency Results in Spectral Clustering and Gaussian Mixture Models. [Doctoral Dissertation]. University of Michigan; 2019. Available from: http://hdl.handle.net/2027.42/151538


University of Southern California

9. Akerling, Zeve. Minor embedding for experimental investigation of a quantum annealer.

Degree: MS, Physics, 2015, University of Southern California

 The D-Wave Quantum Annealer is of interest both for its potential as a quantum information processing platform and as an engineered quantum system for controlled… (more)

Subjects/Keywords: quantum computing; adiabatic quantum computing; programmable quantum annealing; engineered quantum systems; compiler; Ising model; minor embedding; graph theory; simulated annealing; genetic algorithm; quantum signature Hamiltonian; quantum system identification; decoherence; bipartite; Dijkstra shortest path

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Akerling, Z. (2015). Minor embedding for experimental investigation of a quantum annealer. (Masters Thesis). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4095

Chicago Manual of Style (16th Edition):

Akerling, Zeve. “Minor embedding for experimental investigation of a quantum annealer.” 2015. Masters Thesis, University of Southern California. Accessed July 10, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4095.

MLA Handbook (7th Edition):

Akerling, Zeve. “Minor embedding for experimental investigation of a quantum annealer.” 2015. Web. 10 Jul 2020.

Vancouver:

Akerling Z. Minor embedding for experimental investigation of a quantum annealer. [Internet] [Masters thesis]. University of Southern California; 2015. [cited 2020 Jul 10]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4095.

Council of Science Editors:

Akerling Z. Minor embedding for experimental investigation of a quantum annealer. [Masters Thesis]. University of Southern California; 2015. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/594159/rec/4095

10. Campbell, Russell J. Finding obstructions within irreducible triangulations.

Degree: Department of Computer Science, 2017, University of Victoria

 The main results of this dissertation show evidence supporting the Successive Surface Scaffolding Conjecture. This is a new conjecture that, if true, guarantees the existence… (more)

Subjects/Keywords: graph theory; topological graph theory; obstruction; embedding algorithm; irreducible triangulation; torus; projective plane; Klein bottle

…this end, for each edge uv of the graph, an algorithm to determine the faces of an embedding… …embedding algorithm is complicated enough that Mehlhorn, Mutzel [MM96], Chiba, Nishizeki… …embedding algorithm that is theoretically simple to understand. This partly inspired Lempel, Even… …planar-embedding algorithm is worth mentioning because it has an efficient implementation that… …x5D; has explained that their algorithm does not always produce an embedding, and so he… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Campbell, R. J. (2017). Finding obstructions within irreducible triangulations. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/8212

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

Campbell, Russell J. “Finding obstructions within irreducible triangulations.” 2017. Thesis, University of Victoria. Accessed July 10, 2020. http://hdl.handle.net/1828/8212.

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

MLA Handbook (7th Edition):

Campbell, Russell J. “Finding obstructions within irreducible triangulations.” 2017. Web. 10 Jul 2020.

Vancouver:

Campbell RJ. Finding obstructions within irreducible triangulations. [Internet] [Thesis]. University of Victoria; 2017. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1828/8212.

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

Council of Science Editors:

Campbell RJ. Finding obstructions within irreducible triangulations. [Thesis]. University of Victoria; 2017. Available from: http://hdl.handle.net/1828/8212

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

11. Streng, Theodorus Cornelis. Complex multiplication of abelian surfaces.

Degree: 2010, Mathematical Institute, Faculty of Science, Leiden University

 The theory of complex multiplication makes it possible to construct certain class fields and abelian varieties. The main theme of this thesis is making these… (more)

Subjects/Keywords: Abelian surface; Abelian variety; Algorithm; Class field; Class polynomial; CM; Complex multiplication; Curve; Embedding degree; Finite field; Geometry; Igusa; Number theory; Pairing; Abelian surface; Abelian variety; Algorithm; Class field; Class polynomial; CM; Complex multiplication; Curve; Embedding degree; Finite field; Geometry; Igusa; Number theory; Pairing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Streng, T. C. (2010). Complex multiplication of abelian surfaces. (Doctoral Dissertation). Mathematical Institute, Faculty of Science, Leiden University. Retrieved from http://hdl.handle.net/1887/15572

Chicago Manual of Style (16th Edition):

Streng, Theodorus Cornelis. “Complex multiplication of abelian surfaces.” 2010. Doctoral Dissertation, Mathematical Institute, Faculty of Science, Leiden University. Accessed July 10, 2020. http://hdl.handle.net/1887/15572.

MLA Handbook (7th Edition):

Streng, Theodorus Cornelis. “Complex multiplication of abelian surfaces.” 2010. Web. 10 Jul 2020.

Vancouver:

Streng TC. Complex multiplication of abelian surfaces. [Internet] [Doctoral dissertation]. Mathematical Institute, Faculty of Science, Leiden University; 2010. [cited 2020 Jul 10]. Available from: http://hdl.handle.net/1887/15572.

Council of Science Editors:

Streng TC. Complex multiplication of abelian surfaces. [Doctoral Dissertation]. Mathematical Institute, Faculty of Science, Leiden University; 2010. Available from: http://hdl.handle.net/1887/15572

12. Condori-Arapa, Cristina. Antenna elements matching : time-domain analysis.

Degree: Mathematics and Natural Sciences, 2010, University of GävleUniversity of Gävle

  Time domain analysis in vector network analyzers (VNAs) is a method to represent the frequency response, stated by the S-parameters, in time domain with… (more)

Subjects/Keywords: Time-domain analysis; Chirp z-transform; Kaiser-Bessel window; Filtering in time domain; Effects of time-domain analysis; Reverse engineering; De-embedding; TRL algorithm; uncertainties; sensitivity; Electronic measurement and instrumentation; Elektronisk mät- och apparatteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Condori-Arapa, C. (2010). Antenna elements matching : time-domain analysis. (Thesis). University of GävleUniversity of Gävle. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-7783

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

Condori-Arapa, Cristina. “Antenna elements matching : time-domain analysis.” 2010. Thesis, University of GävleUniversity of Gävle. Accessed July 10, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-7783.

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

MLA Handbook (7th Edition):

Condori-Arapa, Cristina. “Antenna elements matching : time-domain analysis.” 2010. Web. 10 Jul 2020.

Vancouver:

Condori-Arapa C. Antenna elements matching : time-domain analysis. [Internet] [Thesis]. University of GävleUniversity of Gävle; 2010. [cited 2020 Jul 10]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-7783.

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

Council of Science Editors:

Condori-Arapa C. Antenna elements matching : time-domain analysis. [Thesis]. University of GävleUniversity of Gävle; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-7783

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

.