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:(Randomized algorithms). Showing records 1 – 30 of 43 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Penn State University

1. Dixit, Kashyap. Robust Models For Property Testing.

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

 Property testing [Rubinfeld Sudan 96,Goldreich Goldwasser Ron 98] is a formal framework for studying approximate sublinear time randomized algorithms for decision problems. These algorithms have… (more)

Subjects/Keywords: Property Testing; Sublinear Algorithms; Randomized Algorithms; Approximation Algorithms; Theoretical Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dixit, K. (2015). Robust Models For Property Testing. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/27153

Chicago Manual of Style (16th Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Doctoral Dissertation, Penn State University. Accessed November 17, 2019. https://etda.libraries.psu.edu/catalog/27153.

MLA Handbook (7th Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Web. 17 Nov 2019.

Vancouver:

Dixit K. Robust Models For Property Testing. [Internet] [Doctoral dissertation]. Penn State University; 2015. [cited 2019 Nov 17]. Available from: https://etda.libraries.psu.edu/catalog/27153.

Council of Science Editors:

Dixit K. Robust Models For Property Testing. [Doctoral Dissertation]. Penn State University; 2015. Available from: https://etda.libraries.psu.edu/catalog/27153


Northeastern University

2. Roche, Scott T. Robust local algorithms for communication and stability in distributed networks.

Degree: PhD, Computer Science Program, 2017, Northeastern University

 In a world in which our technological infrastructure is increasingly reliant on platforms that are distributed in nature, there is a substantial need for distributed… (more)

Subjects/Keywords: applied graph theory; distributed algorithms; epidemic processes; randomized algorithms; random walks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roche, S. T. (2017). Robust local algorithms for communication and stability in distributed networks. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20247295

Chicago Manual of Style (16th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Doctoral Dissertation, Northeastern University. Accessed November 17, 2019. http://hdl.handle.net/2047/D20247295.

MLA Handbook (7th Edition):

Roche, Scott T. “Robust local algorithms for communication and stability in distributed networks.” 2017. Web. 17 Nov 2019.

Vancouver:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Internet] [Doctoral dissertation]. Northeastern University; 2017. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/2047/D20247295.

Council of Science Editors:

Roche ST. Robust local algorithms for communication and stability in distributed networks. [Doctoral Dissertation]. Northeastern University; 2017. Available from: http://hdl.handle.net/2047/D20247295


University of Edinburgh

3. Tang, Junqi. Randomized structure-adaptive optimization.

Degree: PhD, 2019, University of Edinburgh

 This thesis advances the state-of-the-art of randomized optimization algorithms, to efficiently solve the large-scale composite optimization problems which appear increasingly more frequent in modern statistical… (more)

Subjects/Keywords: optimization algorithms; randomization techniques; randomized optimization algorithms; piece-wise smoothness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tang, J. (2019). Randomized structure-adaptive optimization. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/36141

Chicago Manual of Style (16th Edition):

Tang, Junqi. “Randomized structure-adaptive optimization.” 2019. Doctoral Dissertation, University of Edinburgh. Accessed November 17, 2019. http://hdl.handle.net/1842/36141.

MLA Handbook (7th Edition):

Tang, Junqi. “Randomized structure-adaptive optimization.” 2019. Web. 17 Nov 2019.

Vancouver:

Tang J. Randomized structure-adaptive optimization. [Internet] [Doctoral dissertation]. University of Edinburgh; 2019. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1842/36141.

Council of Science Editors:

Tang J. Randomized structure-adaptive optimization. [Doctoral Dissertation]. University of Edinburgh; 2019. Available from: http://hdl.handle.net/1842/36141


University of Iowa

4. Pandit, Saurav. Approximation algorithms for distributed systems.

Degree: PhD, Computer Science, 2010, University of Iowa

  Distributed Approximation is a new and rapidly developing discipline that lies at the crossroads of various well-established areas of Computer Science - Distributed Computing,… (more)

Subjects/Keywords: Approximation algorithms; Complexity; Distributed algorithms; Randomized algorithms; Wireless sensor networks; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pandit, S. (2010). Approximation algorithms for distributed systems. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/870

Chicago Manual of Style (16th Edition):

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Doctoral Dissertation, University of Iowa. Accessed November 17, 2019. https://ir.uiowa.edu/etd/870.

MLA Handbook (7th Edition):

Pandit, Saurav. “Approximation algorithms for distributed systems.” 2010. Web. 17 Nov 2019.

Vancouver:

Pandit S. Approximation algorithms for distributed systems. [Internet] [Doctoral dissertation]. University of Iowa; 2010. [cited 2019 Nov 17]. Available from: https://ir.uiowa.edu/etd/870.

Council of Science Editors:

Pandit S. Approximation algorithms for distributed systems. [Doctoral Dissertation]. University of Iowa; 2010. Available from: https://ir.uiowa.edu/etd/870


Georgia Tech

5. Cannon, Sarah. Markov chains and emergent behavior for problems from discrete geometry.

Degree: PhD, Computer Science, 2018, Georgia Tech

 The problem of generating random samples from large, complex sets is widespread across the sciences, where such samples provide one way to begin to learn… (more)

Subjects/Keywords: Markov chains; Sampling algorithms; Randomized algorithms; Discrete geometry; Dyadic tilings; Programmable matter; Self-organization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cannon, S. (2018). Markov chains and emergent behavior for problems from discrete geometry. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60265

Chicago Manual of Style (16th Edition):

Cannon, Sarah. “Markov chains and emergent behavior for problems from discrete geometry.” 2018. Doctoral Dissertation, Georgia Tech. Accessed November 17, 2019. http://hdl.handle.net/1853/60265.

MLA Handbook (7th Edition):

Cannon, Sarah. “Markov chains and emergent behavior for problems from discrete geometry.” 2018. Web. 17 Nov 2019.

Vancouver:

Cannon S. Markov chains and emergent behavior for problems from discrete geometry. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1853/60265.

Council of Science Editors:

Cannon S. Markov chains and emergent behavior for problems from discrete geometry. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60265


University of Edinburgh

6. Creed, Patrick John. Counting and sampling problems on Eulerian graphs.

Degree: PhD, 2010, University of Edinburgh

 In this thesis we consider two sets of combinatorial structures defined on an Eulerian graph: the Eulerian orientations and Euler tours. We are interested in… (more)

Subjects/Keywords: 518; randomized algorithms; random graphs; computational complexity; combinatorics; Eulerian graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Creed, P. J. (2010). Counting and sampling problems on Eulerian graphs. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/4759

Chicago Manual of Style (16th Edition):

Creed, Patrick John. “Counting and sampling problems on Eulerian graphs.” 2010. Doctoral Dissertation, University of Edinburgh. Accessed November 17, 2019. http://hdl.handle.net/1842/4759.

MLA Handbook (7th Edition):

Creed, Patrick John. “Counting and sampling problems on Eulerian graphs.” 2010. Web. 17 Nov 2019.

Vancouver:

Creed PJ. Counting and sampling problems on Eulerian graphs. [Internet] [Doctoral dissertation]. University of Edinburgh; 2010. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1842/4759.

Council of Science Editors:

Creed PJ. Counting and sampling problems on Eulerian graphs. [Doctoral Dissertation]. University of Edinburgh; 2010. Available from: http://hdl.handle.net/1842/4759


University of Victoria

7. Popova, Diana. Scalable analytics of massive graphs.

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

 Graphs are commonly selected as a model of scientific information: graphs can successfully represent imprecise, uncertain, noisy data; and graph theory has a well-developed mathematical… (more)

Subjects/Keywords: massive graphs; graph analytics; influence maximization; randomized algorithms; influential communities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Popova, D. (2018). Scalable analytics of massive graphs. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/10442

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

Popova, Diana. “Scalable analytics of massive graphs.” 2018. Thesis, University of Victoria. Accessed November 17, 2019. https://dspace.library.uvic.ca//handle/1828/10442.

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

MLA Handbook (7th Edition):

Popova, Diana. “Scalable analytics of massive graphs.” 2018. Web. 17 Nov 2019.

Vancouver:

Popova D. Scalable analytics of massive graphs. [Internet] [Thesis]. University of Victoria; 2018. [cited 2019 Nov 17]. Available from: https://dspace.library.uvic.ca//handle/1828/10442.

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

Council of Science Editors:

Popova D. Scalable analytics of massive graphs. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/10442

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


Cornell University

8. Shrivastava, Anshumali. Probabilistic Hashing Techniques For Big Data .

Degree: 2015, Cornell University

 We investigate probabilistic hashing techniques for addressing computational and memory challenges in large scale machine learning and data mining systems. In this thesis, we show… (more)

Subjects/Keywords: Large Scale Machine Learning; Randomized Algorithms for Big-Data; Hashing, Sketching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shrivastava, A. (2015). Probabilistic Hashing Techniques For Big Data . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/40886

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

Shrivastava, Anshumali. “Probabilistic Hashing Techniques For Big Data .” 2015. Thesis, Cornell University. Accessed November 17, 2019. http://hdl.handle.net/1813/40886.

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

MLA Handbook (7th Edition):

Shrivastava, Anshumali. “Probabilistic Hashing Techniques For Big Data .” 2015. Web. 17 Nov 2019.

Vancouver:

Shrivastava A. Probabilistic Hashing Techniques For Big Data . [Internet] [Thesis]. Cornell University; 2015. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1813/40886.

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

Council of Science Editors:

Shrivastava A. Probabilistic Hashing Techniques For Big Data . [Thesis]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/40886

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


University of California – Berkeley

9. Pilanci, Mert. Fast Randomized Algorithms for Convex Optimization and Statistical Estimation.

Degree: Electrical Engineering & Computer Sciences, 2016, University of California – Berkeley

 With the advent of massive datasets, statistical learning and information processing techniques are expected to enable exceptional possibilities for engineering, data intensive sciences and better… (more)

Subjects/Keywords: Electrical engineering; Computer science; Statistics; big data; convex optimization; estimation; machine learning; randomized algorithms; statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pilanci, M. (2016). Fast Randomized Algorithms for Convex Optimization and Statistical Estimation. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5hq130q6

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

Pilanci, Mert. “Fast Randomized Algorithms for Convex Optimization and Statistical Estimation.” 2016. Thesis, University of California – Berkeley. Accessed November 17, 2019. http://www.escholarship.org/uc/item/5hq130q6.

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

MLA Handbook (7th Edition):

Pilanci, Mert. “Fast Randomized Algorithms for Convex Optimization and Statistical Estimation.” 2016. Web. 17 Nov 2019.

Vancouver:

Pilanci M. Fast Randomized Algorithms for Convex Optimization and Statistical Estimation. [Internet] [Thesis]. University of California – Berkeley; 2016. [cited 2019 Nov 17]. Available from: http://www.escholarship.org/uc/item/5hq130q6.

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

Council of Science Editors:

Pilanci M. Fast Randomized Algorithms for Convex Optimization and Statistical Estimation. [Thesis]. University of California – Berkeley; 2016. Available from: http://www.escholarship.org/uc/item/5hq130q6

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


University of South Florida

10. Alahakoon, Tharaka. Path centrality: A new centrality measure in networks.

Degree: 2010, University of South Florida

 In network analysis, it is useful to identify important vertices in a network. Based on the varying notions of importance of vertices, a number of… (more)

Subjects/Keywords: Betweenness centrality; Social networks; Randomized algorithms; Experimental algorithmics; Graphs; American Studies; Arts and Humanities

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alahakoon, T. (2010). Path centrality: A new centrality measure in networks. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/1558

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

Alahakoon, Tharaka. “Path centrality: A new centrality measure in networks.” 2010. Thesis, University of South Florida. Accessed November 17, 2019. https://scholarcommons.usf.edu/etd/1558.

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

MLA Handbook (7th Edition):

Alahakoon, Tharaka. “Path centrality: A new centrality measure in networks.” 2010. Web. 17 Nov 2019.

Vancouver:

Alahakoon T. Path centrality: A new centrality measure in networks. [Internet] [Thesis]. University of South Florida; 2010. [cited 2019 Nov 17]. Available from: https://scholarcommons.usf.edu/etd/1558.

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

Council of Science Editors:

Alahakoon T. Path centrality: A new centrality measure in networks. [Thesis]. University of South Florida; 2010. Available from: https://scholarcommons.usf.edu/etd/1558

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


Georgia Tech

11. Zhou, Yi. Stochastic algorithms for distributed optimization and machine learning.

Degree: PhD, Industrial and Systems Engineering, 2018, Georgia Tech

 In the big data era, machine learning acts as a powerful tool to help us make predictions and decisions. It has strong ties to the… (more)

Subjects/Keywords: Randomized algorithms; Stochastic optimization; Distributed optimization; Machine learning; Distributed machine learning; Finite-sum optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, Y. (2018). Stochastic algorithms for distributed optimization and machine learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/60256

Chicago Manual of Style (16th Edition):

Zhou, Yi. “Stochastic algorithms for distributed optimization and machine learning.” 2018. Doctoral Dissertation, Georgia Tech. Accessed November 17, 2019. http://hdl.handle.net/1853/60256.

MLA Handbook (7th Edition):

Zhou, Yi. “Stochastic algorithms for distributed optimization and machine learning.” 2018. Web. 17 Nov 2019.

Vancouver:

Zhou Y. Stochastic algorithms for distributed optimization and machine learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1853/60256.

Council of Science Editors:

Zhou Y. Stochastic algorithms for distributed optimization and machine learning. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/60256


Iowa State University

12. Doty, David. Applications of the theory of computation to nanoscale self-assembly.

Degree: 2009, Iowa State University

 This thesis applies the theory of computing to the theory of nanoscale self-assembly, to explore the ability  – and under certain conditions, the inability  –… (more)

Subjects/Keywords: domain-specific language; molecular computation; randomized algorithms; self-assembly; semilinear; theory of computation; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doty, D. (2009). Applications of the theory of computation to nanoscale self-assembly. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/10902

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

Doty, David. “Applications of the theory of computation to nanoscale self-assembly.” 2009. Thesis, Iowa State University. Accessed November 17, 2019. https://lib.dr.iastate.edu/etd/10902.

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

MLA Handbook (7th Edition):

Doty, David. “Applications of the theory of computation to nanoscale self-assembly.” 2009. Web. 17 Nov 2019.

Vancouver:

Doty D. Applications of the theory of computation to nanoscale self-assembly. [Internet] [Thesis]. Iowa State University; 2009. [cited 2019 Nov 17]. Available from: https://lib.dr.iastate.edu/etd/10902.

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

Council of Science Editors:

Doty D. Applications of the theory of computation to nanoscale self-assembly. [Thesis]. Iowa State University; 2009. Available from: https://lib.dr.iastate.edu/etd/10902

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


University of New Mexico

13. Luna Castaneda, Jose Marcio. Optimization and Regulation of Performance for Computing Systems.

Degree: Electrical and Computer Engineering, 2015, University of New Mexico

 The current demands of computing applications, the advent of technological advances related to hardware and software, the contractual relationship between users and cloud service providers… (more)

Subjects/Keywords: Computing Systems; Randomized Algorithms; Discrete Event Systems; Infinitesimal Perturbation Analysis; Statistical Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luna Castaneda, J. M. (2015). Optimization and Regulation of Performance for Computing Systems. (Doctoral Dissertation). University of New Mexico. Retrieved from http://hdl.handle.net/1928/25800

Chicago Manual of Style (16th Edition):

Luna Castaneda, Jose Marcio. “Optimization and Regulation of Performance for Computing Systems.” 2015. Doctoral Dissertation, University of New Mexico. Accessed November 17, 2019. http://hdl.handle.net/1928/25800.

MLA Handbook (7th Edition):

Luna Castaneda, Jose Marcio. “Optimization and Regulation of Performance for Computing Systems.” 2015. Web. 17 Nov 2019.

Vancouver:

Luna Castaneda JM. Optimization and Regulation of Performance for Computing Systems. [Internet] [Doctoral dissertation]. University of New Mexico; 2015. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1928/25800.

Council of Science Editors:

Luna Castaneda JM. Optimization and Regulation of Performance for Computing Systems. [Doctoral Dissertation]. University of New Mexico; 2015. Available from: http://hdl.handle.net/1928/25800

14. Vu, Khac Ky. Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension.

Degree: Docteur es, Informatique, 2016, Paris Saclay

 À l'ère de la numérisation, les données devient pas cher et facile à obtenir. Cela se traduit par de nombreux nouveaux problèmes d'optimisation avec de… (more)

Subjects/Keywords: Réduction de dimension; Approximation; Optimisation; Algorithmes randomisés; Dimension reduction; Approximation; Optimization; Randomized algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vu, K. K. (2016). Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension. (Doctoral Dissertation). Paris Saclay. Retrieved from http://www.theses.fr/2016SACLX031

Chicago Manual of Style (16th Edition):

Vu, Khac Ky. “Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension.” 2016. Doctoral Dissertation, Paris Saclay. Accessed November 17, 2019. http://www.theses.fr/2016SACLX031.

MLA Handbook (7th Edition):

Vu, Khac Ky. “Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension.” 2016. Web. 17 Nov 2019.

Vancouver:

Vu KK. Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension. [Internet] [Doctoral dissertation]. Paris Saclay; 2016. [cited 2019 Nov 17]. Available from: http://www.theses.fr/2016SACLX031.

Council of Science Editors:

Vu KK. Random projection for high-dimensional optimization : Projection aléatoire pour l'optimisation de grande dimension. [Doctoral Dissertation]. Paris Saclay; 2016. Available from: http://www.theses.fr/2016SACLX031


Princeton University

15. Zhao, Zhizhen. Class Averaging in Cryo-EM Single Particle Reconstruction .

Degree: PhD, 2013, Princeton University

 Single-particle reconstruction of vitrified samples (cryogenic electron microscopy, or cryo-EM) provides structural information for a large variety of biological molecules, ranging from small proteins to… (more)

Subjects/Keywords: Bispectrum; Class averaging; Cryo-EM; Fourier-Bessel steerable PCA; Randomized algorithms; Vector diffusion maps

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Z. (2013). Class Averaging in Cryo-EM Single Particle Reconstruction . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01wp988j94j

Chicago Manual of Style (16th Edition):

Zhao, Zhizhen. “Class Averaging in Cryo-EM Single Particle Reconstruction .” 2013. Doctoral Dissertation, Princeton University. Accessed November 17, 2019. http://arks.princeton.edu/ark:/88435/dsp01wp988j94j.

MLA Handbook (7th Edition):

Zhao, Zhizhen. “Class Averaging in Cryo-EM Single Particle Reconstruction .” 2013. Web. 17 Nov 2019.

Vancouver:

Zhao Z. Class Averaging in Cryo-EM Single Particle Reconstruction . [Internet] [Doctoral dissertation]. Princeton University; 2013. [cited 2019 Nov 17]. Available from: http://arks.princeton.edu/ark:/88435/dsp01wp988j94j.

Council of Science Editors:

Zhao Z. Class Averaging in Cryo-EM Single Particle Reconstruction . [Doctoral Dissertation]. Princeton University; 2013. Available from: http://arks.princeton.edu/ark:/88435/dsp01wp988j94j

16. Rady, Amgad Sadek. Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms.

Degree: MSc -MS, Computer Science, 2018, York University

 We show that correctness criteria of concurrent algorithms are mathematically equivalent to the existence of so-called simulations between implementations of the algorithms in a well-known… (more)

Subjects/Keywords: Computer science; Computer science; Distributed computing; Verification; Randomized algorithms; Simulations; Linearizability; Strong linearizability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rady, A. S. (2018). Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms. (Masters Thesis). York University. Retrieved from http://hdl.handle.net/10315/34539

Chicago Manual of Style (16th Edition):

Rady, Amgad Sadek. “Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms.” 2018. Masters Thesis, York University. Accessed November 17, 2019. http://hdl.handle.net/10315/34539.

MLA Handbook (7th Edition):

Rady, Amgad Sadek. “Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms.” 2018. Web. 17 Nov 2019.

Vancouver:

Rady AS. Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms. [Internet] [Masters thesis]. York University; 2018. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/10315/34539.

Council of Science Editors:

Rady AS. Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms. [Masters Thesis]. York University; 2018. Available from: http://hdl.handle.net/10315/34539


University of Notre Dame

17. Philip Damien Little. Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>.

Degree: MSin Computer Science and Engineering, Computer Science and Engineering, 2008, University of Notre Dame

  Many modern applications motivate variations on standard caching problems. Caching is the use of fast storage to serve frequently-requested data replicated from a slow… (more)

Subjects/Keywords: randomized algorithms; competitive analysis; caching; online algorithms; query shipping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Little, P. D. (2008). Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>. (Masters Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/s1784j05v6w

Chicago Manual of Style (16th Edition):

Little, Philip Damien. “Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>.” 2008. Masters Thesis, University of Notre Dame. Accessed November 17, 2019. https://curate.nd.edu/show/s1784j05v6w.

MLA Handbook (7th Edition):

Little, Philip Damien. “Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>.” 2008. Web. 17 Nov 2019.

Vancouver:

Little PD. Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>. [Internet] [Masters thesis]. University of Notre Dame; 2008. [cited 2019 Nov 17]. Available from: https://curate.nd.edu/show/s1784j05v6w.

Council of Science Editors:

Little PD. Online Algorithms for Dynamic Data and Query Shipping in Object Caching</h1>. [Masters Thesis]. University of Notre Dame; 2008. Available from: https://curate.nd.edu/show/s1784j05v6w


EPFL

18. Trummer, Immanuel. From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization.

Degree: 2016, EPFL

 The goal of query optimization is to map a declarative query (describing data to generate) to a query plan (describing how to generate the data)… (more)

Subjects/Keywords: Query optimization; multi-objective query optimization; parametric query optimization; multiple query optimization; approximation algorithms; randomized algorithms; incremental algorithms; parallelization; integer programming; quantum computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Trummer, I. (2016). From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/218998

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

Trummer, Immanuel. “From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization.” 2016. Thesis, EPFL. Accessed November 17, 2019. http://infoscience.epfl.ch/record/218998.

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

MLA Handbook (7th Edition):

Trummer, Immanuel. “From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization.” 2016. Web. 17 Nov 2019.

Vancouver:

Trummer I. From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization. [Internet] [Thesis]. EPFL; 2016. [cited 2019 Nov 17]. Available from: http://infoscience.epfl.ch/record/218998.

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

Council of Science Editors:

Trummer I. From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization. [Thesis]. EPFL; 2016. Available from: http://infoscience.epfl.ch/record/218998

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


INP Toulouse

19. Dalibard, Sébastien. Planification de mouvement pour systèmes anthropomorphes : Motion planning for anthropomorphic systems.

Degree: Docteur es, Systèmes informatiques, 2011, INP Toulouse

L'objet de cette thèse est le développement et l'étude des algorithmes de planification de mouvement pour les systèmes hautement dimensionnés que sont les robots humanoïdes… (more)

Subjects/Keywords: Planification de mouvement; Robotique humanoïde; Animation graphique; Motion planning; Humanoid robotics; Computer animation; Randomized algorithms; Sampling methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dalibard, S. (2011). Planification de mouvement pour systèmes anthropomorphes : Motion planning for anthropomorphic systems. (Doctoral Dissertation). INP Toulouse. Retrieved from http://www.theses.fr/2011INPT0053

Chicago Manual of Style (16th Edition):

Dalibard, Sébastien. “Planification de mouvement pour systèmes anthropomorphes : Motion planning for anthropomorphic systems.” 2011. Doctoral Dissertation, INP Toulouse. Accessed November 17, 2019. http://www.theses.fr/2011INPT0053.

MLA Handbook (7th Edition):

Dalibard, Sébastien. “Planification de mouvement pour systèmes anthropomorphes : Motion planning for anthropomorphic systems.” 2011. Web. 17 Nov 2019.

Vancouver:

Dalibard S. Planification de mouvement pour systèmes anthropomorphes : Motion planning for anthropomorphic systems. [Internet] [Doctoral dissertation]. INP Toulouse; 2011. [cited 2019 Nov 17]. Available from: http://www.theses.fr/2011INPT0053.

Council of Science Editors:

Dalibard S. Planification de mouvement pour systèmes anthropomorphes : Motion planning for anthropomorphic systems. [Doctoral Dissertation]. INP Toulouse; 2011. Available from: http://www.theses.fr/2011INPT0053

20. Pool, E.A.I. Optimizing the Uncertainty Bounds for a Robust Control Problem using Moving Horizon Estimation:.

Degree: 2015, Delft University of Technology

 A classical robust control problem based on randomized algorithms assumes a probability distribution over the uncertainty region to get its controller. This thesis shows that… (more)

Subjects/Keywords: randomized algorithms; moving horizon estimation; robust control

…robust control and randomized algorithms. Without them, this thesis would not have been what it… …based on Linear Matrix Inequalities (LMIs) and one based on Randomized Algorithms… …randomized algorithms[3]. It is assumed that it is possible to take random samples of… …spheroid, is by synthesizing a controller through randomized algorithms, which the next chapter… …will explain. E.A.I. Pool Master of Science Thesis Chapter 3 Randomized Algorithms In… 

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

Pool, E. A. I. (2015). Optimizing the Uncertainty Bounds for a Robust Control Problem using Moving Horizon Estimation:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:48b678f9-0341-4434-8bb8-7080f2d0df0c

Chicago Manual of Style (16th Edition):

Pool, E A I. “Optimizing the Uncertainty Bounds for a Robust Control Problem using Moving Horizon Estimation:.” 2015. Masters Thesis, Delft University of Technology. Accessed November 17, 2019. http://resolver.tudelft.nl/uuid:48b678f9-0341-4434-8bb8-7080f2d0df0c.

MLA Handbook (7th Edition):

Pool, E A I. “Optimizing the Uncertainty Bounds for a Robust Control Problem using Moving Horizon Estimation:.” 2015. Web. 17 Nov 2019.

Vancouver:

Pool EAI. Optimizing the Uncertainty Bounds for a Robust Control Problem using Moving Horizon Estimation:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Nov 17]. Available from: http://resolver.tudelft.nl/uuid:48b678f9-0341-4434-8bb8-7080f2d0df0c.

Council of Science Editors:

Pool EAI. Optimizing the Uncertainty Bounds for a Robust Control Problem using Moving Horizon Estimation:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:48b678f9-0341-4434-8bb8-7080f2d0df0c

21. Gutierrez Soto, Claudio. Exploring the reuse of past search results in information retrieval : Exploration de la réutilisation des résultats des recherches passées dans récupération de l'information.

Degree: Docteur es, Informatique, 2016, Université Toulouse III – Paul Sabatier

Les recherches passées constituent pourtant une source d'information utile pour les nouveaux utilisateurs (nouvelles requêtes). En raison de l'absence de collections ad-hoc de RI, à… (more)

Subjects/Keywords: Information; Randomisé; Récupération; Algorithmes; Passé; Simulation; Recherches; Groupage; Information; Randomized; Retrieval; Algorithms; Past; Simulation; Searches; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gutierrez Soto, C. (2016). Exploring the reuse of past search results in information retrieval : Exploration de la réutilisation des résultats des recherches passées dans récupération de l'information. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2016TOU30034

Chicago Manual of Style (16th Edition):

Gutierrez Soto, Claudio. “Exploring the reuse of past search results in information retrieval : Exploration de la réutilisation des résultats des recherches passées dans récupération de l'information.” 2016. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed November 17, 2019. http://www.theses.fr/2016TOU30034.

MLA Handbook (7th Edition):

Gutierrez Soto, Claudio. “Exploring the reuse of past search results in information retrieval : Exploration de la réutilisation des résultats des recherches passées dans récupération de l'information.” 2016. Web. 17 Nov 2019.

Vancouver:

Gutierrez Soto C. Exploring the reuse of past search results in information retrieval : Exploration de la réutilisation des résultats des recherches passées dans récupération de l'information. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2016. [cited 2019 Nov 17]. Available from: http://www.theses.fr/2016TOU30034.

Council of Science Editors:

Gutierrez Soto C. Exploring the reuse of past search results in information retrieval : Exploration de la réutilisation des résultats des recherches passées dans récupération de l'information. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2016. Available from: http://www.theses.fr/2016TOU30034

22. TENG DAN. RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS.

Degree: 2017, National University of Singapore

Subjects/Keywords: Randomized algorithms; Least squares; Low Rank Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

DAN, T. (2017). RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/137525

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

DAN, TENG. “RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS.” 2017. Thesis, National University of Singapore. Accessed November 17, 2019. http://scholarbank.nus.edu.sg/handle/10635/137525.

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

MLA Handbook (7th Edition):

DAN, TENG. “RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS.” 2017. Web. 17 Nov 2019.

Vancouver:

DAN T. RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS. [Internet] [Thesis]. National University of Singapore; 2017. [cited 2019 Nov 17]. Available from: http://scholarbank.nus.edu.sg/handle/10635/137525.

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

Council of Science Editors:

DAN T. RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS. [Thesis]. National University of Singapore; 2017. Available from: http://scholarbank.nus.edu.sg/handle/10635/137525

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


University of Edinburgh

23. Loizou, Nicolas. Randomized iterative methods for linear systems : momentum, inexactness and gossip.

Degree: PhD, 2019, University of Edinburgh

 In the era of big data, one of the key challenges is the development of novel optimization algorithms that can accommodate vast amounts of data… (more)

Subjects/Keywords: optimization problems; complexity analysis; stochastic optimization algorithms; heavy ball momentum; stochastic gradient descent; stochastic Newton; stochastic proximal point; stochastic dual subspace ascent; convex quadratic problems; randomized Gaussian Kaczmarz; randomized gossip algorithms; Binary Oracle; Controlled Noise Insertion; e -Gap Oracle

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Loizou, N. (2019). Randomized iterative methods for linear systems : momentum, inexactness and gossip. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/36203

Chicago Manual of Style (16th Edition):

Loizou, Nicolas. “Randomized iterative methods for linear systems : momentum, inexactness and gossip.” 2019. Doctoral Dissertation, University of Edinburgh. Accessed November 17, 2019. http://hdl.handle.net/1842/36203.

MLA Handbook (7th Edition):

Loizou, Nicolas. “Randomized iterative methods for linear systems : momentum, inexactness and gossip.” 2019. Web. 17 Nov 2019.

Vancouver:

Loizou N. Randomized iterative methods for linear systems : momentum, inexactness and gossip. [Internet] [Doctoral dissertation]. University of Edinburgh; 2019. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1842/36203.

Council of Science Editors:

Loizou N. Randomized iterative methods for linear systems : momentum, inexactness and gossip. [Doctoral Dissertation]. University of Edinburgh; 2019. Available from: http://hdl.handle.net/1842/36203


Indian Institute of Science

24. Bhatia, Ashutosh. Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks.

Degree: 2015, Indian Institute of Science

 A wireless sensor network (WSN) is a collection of sensor nodes distributed over a geographical region to obtain the environmental data. It can have different… (more)

Subjects/Keywords: Time Division Multiple Access (TDMA) Scheduling Algorithms; Wireless Sensor Networks; Distributed Schedule-Compaction (DSC) Algorithms; Randomized Distributed Scheuling Algorithm (RD-TDMA); Media Access Control (MAC) Protocol; Distributed TDMA Slot Scheduling (DTSS); Distributed Schedule Length Reduction (DSLR) Algorithms; Wireless Communication; Multi-Hop Wireless Sensor Networks; WSNs; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhatia, A. (2015). Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3552 ; http://etd.iisc.ernet.in/abstracts/4420/G27334-Abs.pdf

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

Bhatia, Ashutosh. “Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks.” 2015. Thesis, Indian Institute of Science. Accessed November 17, 2019. http://etd.iisc.ernet.in/2005/3552 ; http://etd.iisc.ernet.in/abstracts/4420/G27334-Abs.pdf.

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

MLA Handbook (7th Edition):

Bhatia, Ashutosh. “Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks.” 2015. Web. 17 Nov 2019.

Vancouver:

Bhatia A. Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks. [Internet] [Thesis]. Indian Institute of Science; 2015. [cited 2019 Nov 17]. Available from: http://etd.iisc.ernet.in/2005/3552 ; http://etd.iisc.ernet.in/abstracts/4420/G27334-Abs.pdf.

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

Council of Science Editors:

Bhatia A. Distributed TDMA-Scheduling and Schedule-Compaction Algorithms for Efficient Communication in Wireless Sensor Networks. [Thesis]. Indian Institute of Science; 2015. Available from: http://etd.iisc.ernet.in/2005/3552 ; http://etd.iisc.ernet.in/abstracts/4420/G27334-Abs.pdf

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


University of Oxford

25. Benfold, Ben. The acquisition of coarse gaze estimates in visual surveillance.

Degree: PhD, 2011, University of Oxford

 This thesis describes the development of methods for automatically obtaining coarse gaze direction estimates for pedestrians in surveillance video. Gaze direction estimates are beneficial in… (more)

Subjects/Keywords: 621.38928; Information engineering; Image understanding; Applications and algorithms; computer vision; machine vision; gaze; head pose; surveillance; visual surveillance; video surveillance; video analysis; attention; randomised tree; randomized tree; randomised fern; randomized fern; tracking; head tracking; thesis; predicate fern

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Benfold, B. (2011). The acquisition of coarse gaze estimates in visual surveillance. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:59186519-9fee-4005-9570-0e3cf0384447 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572832

Chicago Manual of Style (16th Edition):

Benfold, Ben. “The acquisition of coarse gaze estimates in visual surveillance.” 2011. Doctoral Dissertation, University of Oxford. Accessed November 17, 2019. http://ora.ox.ac.uk/objects/uuid:59186519-9fee-4005-9570-0e3cf0384447 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572832.

MLA Handbook (7th Edition):

Benfold, Ben. “The acquisition of coarse gaze estimates in visual surveillance.” 2011. Web. 17 Nov 2019.

Vancouver:

Benfold B. The acquisition of coarse gaze estimates in visual surveillance. [Internet] [Doctoral dissertation]. University of Oxford; 2011. [cited 2019 Nov 17]. Available from: http://ora.ox.ac.uk/objects/uuid:59186519-9fee-4005-9570-0e3cf0384447 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572832.

Council of Science Editors:

Benfold B. The acquisition of coarse gaze estimates in visual surveillance. [Doctoral Dissertation]. University of Oxford; 2011. Available from: http://ora.ox.ac.uk/objects/uuid:59186519-9fee-4005-9570-0e3cf0384447 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572832


Texas A&M University

26. Neumann, Nicholas Gerard. Two algorithms for leader election and network size estimation in mobile ad hoc networks.

Degree: 2005, Texas A&M University

 We develop two algorithms for important problems in mobile ad hoc networks (MANETs). A MANET is a collection of mobile processors (?nodes?) which communicate via… (more)

Subjects/Keywords: mobile ad hoc networks; leader election; network size estimation; distributed computing; randomized algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neumann, N. G. (2005). Two algorithms for leader election and network size estimation in mobile ad hoc networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/1321

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

Neumann, Nicholas Gerard. “Two algorithms for leader election and network size estimation in mobile ad hoc networks.” 2005. Thesis, Texas A&M University. Accessed November 17, 2019. http://hdl.handle.net/1969.1/1321.

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

MLA Handbook (7th Edition):

Neumann, Nicholas Gerard. “Two algorithms for leader election and network size estimation in mobile ad hoc networks.” 2005. Web. 17 Nov 2019.

Vancouver:

Neumann NG. Two algorithms for leader election and network size estimation in mobile ad hoc networks. [Internet] [Thesis]. Texas A&M University; 2005. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1969.1/1321.

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

Council of Science Editors:

Neumann NG. Two algorithms for leader election and network size estimation in mobile ad hoc networks. [Thesis]. Texas A&M University; 2005. Available from: http://hdl.handle.net/1969.1/1321

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


Universidade de Lisboa

27. Moniz, Henrique Lícias Senra. Randomized intrusion-tolerant asynchronous services.

Degree: 2006, Universidade de Lisboa

Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and time complexities,… (more)

Subjects/Keywords: Intrusion tolerance; Byzantine agreement; Randomized algorithms; Performance evaluation; Teses de mestrado - 2006

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moniz, H. L. S. (2006). Randomized intrusion-tolerant asynchronous services. (Thesis). Universidade de Lisboa. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/14027

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

Moniz, Henrique Lícias Senra. “Randomized intrusion-tolerant asynchronous services.” 2006. Thesis, Universidade de Lisboa. Accessed November 17, 2019. http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/14027.

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

MLA Handbook (7th Edition):

Moniz, Henrique Lícias Senra. “Randomized intrusion-tolerant asynchronous services.” 2006. Web. 17 Nov 2019.

Vancouver:

Moniz HLS. Randomized intrusion-tolerant asynchronous services. [Internet] [Thesis]. Universidade de Lisboa; 2006. [cited 2019 Nov 17]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/14027.

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

Council of Science Editors:

Moniz HLS. Randomized intrusion-tolerant asynchronous services. [Thesis]. Universidade de Lisboa; 2006. Available from: http://www.rcaap.pt/detail.jsp?id=oai:repositorio.ul.pt:10451/14027

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


EPFL

28. Fatemi, Mitra. Shapes from Pixels.

Degree: 2016, EPFL

 In today's digital world, sampling is at the heart of any signal acquisition device. Imaging devices are ubiquitous examples that capture two-dimensional visual signals and… (more)

Subjects/Keywords: Algebraic curves; binary images; Cheeger sets; compressed sensing; generalized moments; generalized sampling; image sampling; measurement-consistency; randomized algorithms; shapes; signals with finite rate of innovation (FRI) total variation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fatemi, M. (2016). Shapes from Pixels. (Thesis). EPFL. Retrieved from http://infoscience.epfl.ch/record/217380

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

Fatemi, Mitra. “Shapes from Pixels.” 2016. Thesis, EPFL. Accessed November 17, 2019. http://infoscience.epfl.ch/record/217380.

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

MLA Handbook (7th Edition):

Fatemi, Mitra. “Shapes from Pixels.” 2016. Web. 17 Nov 2019.

Vancouver:

Fatemi M. Shapes from Pixels. [Internet] [Thesis]. EPFL; 2016. [cited 2019 Nov 17]. Available from: http://infoscience.epfl.ch/record/217380.

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

Council of Science Editors:

Fatemi M. Shapes from Pixels. [Thesis]. EPFL; 2016. Available from: http://infoscience.epfl.ch/record/217380

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

29. Cousins, Benjamin. Efficient high-dimensional sampling and integration.

Degree: PhD, Computer Science, 2017, Georgia Tech

 Volume computation is an algorithmic version of the fundamental geometric problem to figure out how much space an object occupies. Related problems of sampling and… (more)

Subjects/Keywords: Sampling; Volume computation; Randomized algorithms; Markov chains; Isoperimetry

…computation. Both of these algorithms essentially use a randomized sampler as a black-box, thus the… …of volume computation, randomized sampling, and integration, both in theory and practice… …The search for efficient algorithms for volume computation has been an active area of… …1] gave a polynomial time randomized algorithm to approximate the volume of any… …fundamental algorithmic tools for such sets. In addition to yielding practical algorithms, the… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cousins, B. (2017). Efficient high-dimensional sampling and integration. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58671

Chicago Manual of Style (16th Edition):

Cousins, Benjamin. “Efficient high-dimensional sampling and integration.” 2017. Doctoral Dissertation, Georgia Tech. Accessed November 17, 2019. http://hdl.handle.net/1853/58671.

MLA Handbook (7th Edition):

Cousins, Benjamin. “Efficient high-dimensional sampling and integration.” 2017. Web. 17 Nov 2019.

Vancouver:

Cousins B. Efficient high-dimensional sampling and integration. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2019 Nov 17]. Available from: http://hdl.handle.net/1853/58671.

Council of Science Editors:

Cousins B. Efficient high-dimensional sampling and integration. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/58671

30. MOHAMMADREZA CHAMANBAZ. Randomized algorithms for control of uncertain systems with application to hand disk drives.

Degree: 2014, National University of Singapore

Subjects/Keywords: Randomized Algorithms; Uncertainty; Robust Optimization; Monte Carlo Simulation; Statistical Learning Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

CHAMANBAZ, M. (2014). Randomized algorithms for control of uncertain systems with application to hand disk drives. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/53688

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

CHAMANBAZ, MOHAMMADREZA. “Randomized algorithms for control of uncertain systems with application to hand disk drives.” 2014. Thesis, National University of Singapore. Accessed November 17, 2019. http://scholarbank.nus.edu.sg/handle/10635/53688.

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

MLA Handbook (7th Edition):

CHAMANBAZ, MOHAMMADREZA. “Randomized algorithms for control of uncertain systems with application to hand disk drives.” 2014. Web. 17 Nov 2019.

Vancouver:

CHAMANBAZ M. Randomized algorithms for control of uncertain systems with application to hand disk drives. [Internet] [Thesis]. National University of Singapore; 2014. [cited 2019 Nov 17]. Available from: http://scholarbank.nus.edu.sg/handle/10635/53688.

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

Council of Science Editors:

CHAMANBAZ M. Randomized algorithms for control of uncertain systems with application to hand disk drives. [Thesis]. National University of Singapore; 2014. Available from: http://scholarbank.nus.edu.sg/handle/10635/53688

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

[1] [2]

.