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

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Sydney

1. Pang, Xiaolin. Scalable Algorithms for Outlier Detection .

Degree: 2014, University of Sydney

 Outlier detection is an important problem for the data mining community as outliers often embody potentially new and valuable information. Nowadays, in the face of… (more)

Subjects/Keywords: scalable algorithms; outlier detection; parallel computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pang, X. (2014). Scalable Algorithms for Outlier Detection . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/11743

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

Pang, Xiaolin. “Scalable Algorithms for Outlier Detection .” 2014. Thesis, University of Sydney. Accessed April 21, 2019. http://hdl.handle.net/2123/11743.

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

MLA Handbook (7th Edition):

Pang, Xiaolin. “Scalable Algorithms for Outlier Detection .” 2014. Web. 21 Apr 2019.

Vancouver:

Pang X. Scalable Algorithms for Outlier Detection . [Internet] [Thesis]. University of Sydney; 2014. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/2123/11743.

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

Council of Science Editors:

Pang X. Scalable Algorithms for Outlier Detection . [Thesis]. University of Sydney; 2014. Available from: http://hdl.handle.net/2123/11743

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


The Ohio State University

2. Slatton, Andrew G. Scalable Algorithms for Delaunay Mesh Generation.

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

 Delaunay refinement is a useful tool for sampling and meshing. Pioneered by Ruppert and Chew for piecewise-linear complexes in R2, Delaunay refinement has been extended… (more)

Subjects/Keywords: Computer Science; Mesh generation; Delaunay; Parallel algorithms; Scalable algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Slatton, A. G. (2014). Scalable Algorithms for Delaunay Mesh Generation. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013

Chicago Manual of Style (16th Edition):

Slatton, Andrew G. “Scalable Algorithms for Delaunay Mesh Generation.” 2014. Doctoral Dissertation, The Ohio State University. Accessed April 21, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013.

MLA Handbook (7th Edition):

Slatton, Andrew G. “Scalable Algorithms for Delaunay Mesh Generation.” 2014. Web. 21 Apr 2019.

Vancouver:

Slatton AG. Scalable Algorithms for Delaunay Mesh Generation. [Internet] [Doctoral dissertation]. The Ohio State University; 2014. [cited 2019 Apr 21]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013.

Council of Science Editors:

Slatton AG. Scalable Algorithms for Delaunay Mesh Generation. [Doctoral Dissertation]. The Ohio State University; 2014. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1406758013


University of Oxford

3. Ferranti, Ettore. Multi-agent exploration of unknown areas.

Degree: PhD, 2010, University of Oxford

 This work focuses on the autonomous exploration of unknown areas by a swarm of mobile robots, referred to as agents. When an emergency happens within… (more)

Subjects/Keywords: 006.3; Software engineering; Applications and algorithms; Scalable systems; Robotics; Sensors; multi-agent systems; robotics; exploration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ferranti, E. (2010). Multi-agent exploration of unknown areas. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:80f73481-1370-498e-ab43-d86f9af11a62 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531814

Chicago Manual of Style (16th Edition):

Ferranti, Ettore. “Multi-agent exploration of unknown areas.” 2010. Doctoral Dissertation, University of Oxford. Accessed April 21, 2019. http://ora.ox.ac.uk/objects/uuid:80f73481-1370-498e-ab43-d86f9af11a62 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531814.

MLA Handbook (7th Edition):

Ferranti, Ettore. “Multi-agent exploration of unknown areas.” 2010. Web. 21 Apr 2019.

Vancouver:

Ferranti E. Multi-agent exploration of unknown areas. [Internet] [Doctoral dissertation]. University of Oxford; 2010. [cited 2019 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:80f73481-1370-498e-ab43-d86f9af11a62 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531814.

Council of Science Editors:

Ferranti E. Multi-agent exploration of unknown areas. [Doctoral Dissertation]. University of Oxford; 2010. Available from: http://ora.ox.ac.uk/objects/uuid:80f73481-1370-498e-ab43-d86f9af11a62 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531814

4. Ho, Qirong. Modeling Large Social Networks in Context.

Degree: 2014, Carnegie Mellon University

 Today’s social and internet networks contain millions or even billions of nodes, and copious amounts of side information (context) such as text, attribute, temporal, image… (more)

Subjects/Keywords: Social Networks; Statistical Models; Scalable Algorithms; Big Data; Distributed Systems; Cluster Computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ho, Q. (2014). Modeling Large Social Networks in Context. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/543

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

Ho, Qirong. “Modeling Large Social Networks in Context.” 2014. Thesis, Carnegie Mellon University. Accessed April 21, 2019. http://repository.cmu.edu/dissertations/543.

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

MLA Handbook (7th Edition):

Ho, Qirong. “Modeling Large Social Networks in Context.” 2014. Web. 21 Apr 2019.

Vancouver:

Ho Q. Modeling Large Social Networks in Context. [Internet] [Thesis]. Carnegie Mellon University; 2014. [cited 2019 Apr 21]. Available from: http://repository.cmu.edu/dissertations/543.

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

Council of Science Editors:

Ho Q. Modeling Large Social Networks in Context. [Thesis]. Carnegie Mellon University; 2014. Available from: http://repository.cmu.edu/dissertations/543

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


University of California – Berkeley

5. Ray, Sayak. Scalable Model Checking Beyond Safety - A Communication Fabric Perspective.

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

 In this research, we have developed symbolic algorithms and their open-source implemen-tations that effectively solve liveness verification problem for industrially relevant hardwaresystems. In principle, our… (more)

Subjects/Keywords: Computer engineering; Computer science; Communication Fabrics; Formal Verification; Liveness; Scalable Model Checking; Symbolic Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ray, S. (2013). Scalable Model Checking Beyond Safety - A Communication Fabric Perspective. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8dk5b1qz

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

Ray, Sayak. “Scalable Model Checking Beyond Safety - A Communication Fabric Perspective.” 2013. Thesis, University of California – Berkeley. Accessed April 21, 2019. http://www.escholarship.org/uc/item/8dk5b1qz.

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

MLA Handbook (7th Edition):

Ray, Sayak. “Scalable Model Checking Beyond Safety - A Communication Fabric Perspective.” 2013. Web. 21 Apr 2019.

Vancouver:

Ray S. Scalable Model Checking Beyond Safety - A Communication Fabric Perspective. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2019 Apr 21]. Available from: http://www.escholarship.org/uc/item/8dk5b1qz.

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

Council of Science Editors:

Ray S. Scalable Model Checking Beyond Safety - A Communication Fabric Perspective. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/8dk5b1qz

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


University of Texas – Austin

6. Bhojanapalli, Venkata Sesha Pavana Srinadh. Large scale matrix factorization with guarantees: sampling and bi-linearity.

Degree: Electrical and Computer Engineering, 2015, University of Texas – Austin

 Low rank matrix factorization is an important step in many high dimensional machine learning algorithms. Traditional algorithms for factorization do not scale well with the… (more)

Subjects/Keywords: Matrix completion; Non-convex optimization; Low rank approximation; Semi-definite optimization; Tensor factorization; Scalable algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhojanapalli, V. S. P. S. (2015). Large scale matrix factorization with guarantees: sampling and bi-linearity. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/32832

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

Bhojanapalli, Venkata Sesha Pavana Srinadh. “Large scale matrix factorization with guarantees: sampling and bi-linearity.” 2015. Thesis, University of Texas – Austin. Accessed April 21, 2019. http://hdl.handle.net/2152/32832.

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

MLA Handbook (7th Edition):

Bhojanapalli, Venkata Sesha Pavana Srinadh. “Large scale matrix factorization with guarantees: sampling and bi-linearity.” 2015. Web. 21 Apr 2019.

Vancouver:

Bhojanapalli VSPS. Large scale matrix factorization with guarantees: sampling and bi-linearity. [Internet] [Thesis]. University of Texas – Austin; 2015. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/2152/32832.

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

Council of Science Editors:

Bhojanapalli VSPS. Large scale matrix factorization with guarantees: sampling and bi-linearity. [Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/32832

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


University of Michigan

7. Chen, Li-Yen. Scalable Algorithms for Communication Networks.

Degree: PhD, Electrical Engineering: Systems, 2010, University of Michigan

 Network scalability has emerged as the essential problem in designing architectures and protocols for large-scale communication systems. Minor efficiencies, that can be tolerated in small… (more)

Subjects/Keywords: Scalable Algorithms; Routing; Switch Scheduling; Bandwidth Sharing; Computer Science; Electrical Engineering; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, L. (2010). Scalable Algorithms for Communication Networks. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/77713

Chicago Manual of Style (16th Edition):

Chen, Li-Yen. “Scalable Algorithms for Communication Networks.” 2010. Doctoral Dissertation, University of Michigan. Accessed April 21, 2019. http://hdl.handle.net/2027.42/77713.

MLA Handbook (7th Edition):

Chen, Li-Yen. “Scalable Algorithms for Communication Networks.” 2010. Web. 21 Apr 2019.

Vancouver:

Chen L. Scalable Algorithms for Communication Networks. [Internet] [Doctoral dissertation]. University of Michigan; 2010. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/2027.42/77713.

Council of Science Editors:

Chen L. Scalable Algorithms for Communication Networks. [Doctoral Dissertation]. University of Michigan; 2010. Available from: http://hdl.handle.net/2027.42/77713


Georgia Tech

8. Holmes, Michael P. Multi-tree Monte Carlo methods for fast, scalable machine learning.

Degree: PhD, Computing, 2009, Georgia Tech

 As modern applications of machine learning and data mining are forced to deal with ever more massive quantities of data, practitioners quickly run into difficulty… (more)

Subjects/Keywords: Machine learning; SVD; Scalable; Monte Carlo; Kernel estimators; Large data; Monte Carlo method; Trees Development Data processing; Algorithms; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Holmes, M. P. (2009). Multi-tree Monte Carlo methods for fast, scalable machine learning. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/33865

Chicago Manual of Style (16th Edition):

Holmes, Michael P. “Multi-tree Monte Carlo methods for fast, scalable machine learning.” 2009. Doctoral Dissertation, Georgia Tech. Accessed April 21, 2019. http://hdl.handle.net/1853/33865.

MLA Handbook (7th Edition):

Holmes, Michael P. “Multi-tree Monte Carlo methods for fast, scalable machine learning.” 2009. Web. 21 Apr 2019.

Vancouver:

Holmes MP. Multi-tree Monte Carlo methods for fast, scalable machine learning. [Internet] [Doctoral dissertation]. Georgia Tech; 2009. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1853/33865.

Council of Science Editors:

Holmes MP. Multi-tree Monte Carlo methods for fast, scalable machine learning. [Doctoral Dissertation]. Georgia Tech; 2009. Available from: http://hdl.handle.net/1853/33865


Ohio University

9. Zhang, Wenle. Scalable deadlock avoidance algorithms for flexible manufacturing systems.

Degree: PhD, Electrical Engineering & Computer Science (Engineering and Technology), 2000, Ohio University

  Existing deadlock prevention and avoidance methods for flexible manufacturing systems have either restricted the class of systems they apply to, or are conservative so… (more)

Subjects/Keywords: Scalable algorithms; deadlock avoidance algorithms; flexible manufacturing systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, W. (2000). Scalable deadlock avoidance algorithms for flexible manufacturing systems. (Doctoral Dissertation). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449

Chicago Manual of Style (16th Edition):

Zhang, Wenle. “Scalable deadlock avoidance algorithms for flexible manufacturing systems.” 2000. Doctoral Dissertation, Ohio University. Accessed April 21, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449.

MLA Handbook (7th Edition):

Zhang, Wenle. “Scalable deadlock avoidance algorithms for flexible manufacturing systems.” 2000. Web. 21 Apr 2019.

Vancouver:

Zhang W. Scalable deadlock avoidance algorithms for flexible manufacturing systems. [Internet] [Doctoral dissertation]. Ohio University; 2000. [cited 2019 Apr 21]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449.

Council of Science Editors:

Zhang W. Scalable deadlock avoidance algorithms for flexible manufacturing systems. [Doctoral Dissertation]. Ohio University; 2000. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1179862449


University of New South Wales

10. Elfeky, Ehab Zaky Mohammed Abdullah. Evolutionary Algorithms for Constrained Optimization.

Degree: Engineering & Information Technology, 2009, University of New South Wales

 Most real world optimization problems, and their corresponding models, are complex. This complexity arises from different sources, such as existence of the constraints, function characteristics,… (more)

Subjects/Keywords: Evolutionary Algorithms; Genetic Algorithms; Continuous Constrained Optimization; Cooperative Coevolution; Large-scale Optimization; Decomposition; Parallel Genetic Algorithms; Message Passing Interface; Scalable Test Problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Elfeky, E. Z. M. A. (2009). Evolutionary Algorithms for Constrained Optimization. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Elfeky, Ehab Zaky Mohammed Abdullah. “Evolutionary Algorithms for Constrained Optimization.” 2009. Doctoral Dissertation, University of New South Wales. Accessed April 21, 2019. http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true.

MLA Handbook (7th Edition):

Elfeky, Ehab Zaky Mohammed Abdullah. “Evolutionary Algorithms for Constrained Optimization.” 2009. Web. 21 Apr 2019.

Vancouver:

Elfeky EZMA. Evolutionary Algorithms for Constrained Optimization. [Internet] [Doctoral dissertation]. University of New South Wales; 2009. [cited 2019 Apr 21]. Available from: http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true.

Council of Science Editors:

Elfeky EZMA. Evolutionary Algorithms for Constrained Optimization. [Doctoral Dissertation]. University of New South Wales; 2009. Available from: http://handle.unsw.edu.au/1959.4/52044 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10714/SOURCE01?view=true


Cornell University

11. Ganapathysubramanian, Baskar. COMPUTATIONAL STRATEGIES FOR DATA-DRIVEN MODELING OF STOCHASTIC SYSTEMS .

Degree: 2008, Cornell University

 Many physical systems of fundamental and industrial importance are significantly affected by the underlying fluctuations/variations in boundary, initial conditions as well as variabilities in operating… (more)

Subjects/Keywords: Stochastic partial differential equations; Collocation methods; Sparse grids; Scalable algorithms; Nonlinear model reduction; Variational multiscale methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ganapathysubramanian, B. (2008). COMPUTATIONAL STRATEGIES FOR DATA-DRIVEN MODELING OF STOCHASTIC SYSTEMS . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/11099

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

Ganapathysubramanian, Baskar. “COMPUTATIONAL STRATEGIES FOR DATA-DRIVEN MODELING OF STOCHASTIC SYSTEMS .” 2008. Thesis, Cornell University. Accessed April 21, 2019. http://hdl.handle.net/1813/11099.

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

MLA Handbook (7th Edition):

Ganapathysubramanian, Baskar. “COMPUTATIONAL STRATEGIES FOR DATA-DRIVEN MODELING OF STOCHASTIC SYSTEMS .” 2008. Web. 21 Apr 2019.

Vancouver:

Ganapathysubramanian B. COMPUTATIONAL STRATEGIES FOR DATA-DRIVEN MODELING OF STOCHASTIC SYSTEMS . [Internet] [Thesis]. Cornell University; 2008. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1813/11099.

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

Council of Science Editors:

Ganapathysubramanian B. COMPUTATIONAL STRATEGIES FOR DATA-DRIVEN MODELING OF STOCHASTIC SYSTEMS . [Thesis]. Cornell University; 2008. Available from: http://hdl.handle.net/1813/11099

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


University of Oxford

12. Feng, Lu. On learning assumptions for compositional verification of probabilistic systems.

Degree: PhD, 2014, University of Oxford

 Probabilistic model checking is a powerful formal verification method that can ensure the correctness of real-life systems that exhibit stochastic behaviour. The work presented in… (more)

Subjects/Keywords: 518.28; Computer science (mathematics); Theory and automated verification; Scalable systems; Applications and algorithms; Software engineering; Compositional verification; Computational learning; Assume-guarantee reasoning; Probabilistic model checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feng, L. (2014). On learning assumptions for compositional verification of probabilistic systems. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:12502ba2-478f-429a-a250-6590c43a8e8a ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606259

Chicago Manual of Style (16th Edition):

Feng, Lu. “On learning assumptions for compositional verification of probabilistic systems.” 2014. Doctoral Dissertation, University of Oxford. Accessed April 21, 2019. http://ora.ox.ac.uk/objects/uuid:12502ba2-478f-429a-a250-6590c43a8e8a ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606259.

MLA Handbook (7th Edition):

Feng, Lu. “On learning assumptions for compositional verification of probabilistic systems.” 2014. Web. 21 Apr 2019.

Vancouver:

Feng L. On learning assumptions for compositional verification of probabilistic systems. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:12502ba2-478f-429a-a250-6590c43a8e8a ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606259.

Council of Science Editors:

Feng L. On learning assumptions for compositional verification of probabilistic systems. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:12502ba2-478f-429a-a250-6590c43a8e8a ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606259


University of Technology, Sydney

13. Li, Mu. Coupling analysis in educational data.

Degree: 2015, University of Technology, Sydney

 Educational data analysis refers to techniques, tools, and research designed to automatically extract meaning from large repositories of data generated by or related to people’s… (more)

Subjects/Keywords: Educational data analysis.; Data mining algorithms.; Coupling analysis.; Student performance prediction analysis.; Student social media sentiment analysis.; Scalable educational data mining platform.; Spark cluster.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, M. (2015). Coupling analysis in educational data. (Thesis). University of Technology, Sydney. Retrieved from http://hdl.handle.net/10453/43410

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

Li, Mu. “Coupling analysis in educational data.” 2015. Thesis, University of Technology, Sydney. Accessed April 21, 2019. http://hdl.handle.net/10453/43410.

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

MLA Handbook (7th Edition):

Li, Mu. “Coupling analysis in educational data.” 2015. Web. 21 Apr 2019.

Vancouver:

Li M. Coupling analysis in educational data. [Internet] [Thesis]. University of Technology, Sydney; 2015. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/10453/43410.

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

Council of Science Editors:

Li M. Coupling analysis in educational data. [Thesis]. University of Technology, Sydney; 2015. Available from: http://hdl.handle.net/10453/43410

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


University of Oxford

14. Fink, Robert D. Evaluation of relational algebra queries on probabilistic databases : tractability and approximation.

Degree: PhD, 2014, University of Oxford

 Query processing is a core task in probabilistic databases: Given a query and a database that encodes uncertainty in data by means of probability distributions,… (more)

Subjects/Keywords: 005.74; Computer science (mathematics); Discrete mathematics (statistics); Probability; Applications and algorithms; Scalable systems; Probabilistic database; uncertain database; database; database system; computational complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fink, R. D. (2014). Evaluation of relational algebra queries on probabilistic databases : tractability and approximation. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b2188d19-ce55-44ae-bd20-7d50ea6f519b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635297

Chicago Manual of Style (16th Edition):

Fink, Robert D. “Evaluation of relational algebra queries on probabilistic databases : tractability and approximation.” 2014. Doctoral Dissertation, University of Oxford. Accessed April 21, 2019. http://ora.ox.ac.uk/objects/uuid:b2188d19-ce55-44ae-bd20-7d50ea6f519b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635297.

MLA Handbook (7th Edition):

Fink, Robert D. “Evaluation of relational algebra queries on probabilistic databases : tractability and approximation.” 2014. Web. 21 Apr 2019.

Vancouver:

Fink RD. Evaluation of relational algebra queries on probabilistic databases : tractability and approximation. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:b2188d19-ce55-44ae-bd20-7d50ea6f519b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635297.

Council of Science Editors:

Fink RD. Evaluation of relational algebra queries on probabilistic databases : tractability and approximation. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:b2188d19-ce55-44ae-bd20-7d50ea6f519b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635297


University of Texas – Austin

15. -0613-6243. A computational framework for the solution of infinite-dimensional Bayesian statistical inverse problems with application to global seismic inversion.

Degree: Computational Science, Engineering, and Mathematics, 2015, University of Texas – Austin

 Quantifying uncertainties in large-scale forward and inverse PDE simulations has emerged as a central challenge facing the field of computational science and engineering. The promise… (more)

Subjects/Keywords: Bayesian inference; Infinite-dimensional inverse problems; Uncertainty quantification; Low-rank approximation; Optimality; Scalable algorithms; High performance computing; Markov chain Monte Carlo; Stochastic Newton; Seismic wave propagation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-0613-6243. (2015). A computational framework for the solution of infinite-dimensional Bayesian statistical inverse problems with application to global seismic inversion. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/31374

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

Chicago Manual of Style (16th Edition):

-0613-6243. “A computational framework for the solution of infinite-dimensional Bayesian statistical inverse problems with application to global seismic inversion.” 2015. Thesis, University of Texas – Austin. Accessed April 21, 2019. http://hdl.handle.net/2152/31374.

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

MLA Handbook (7th Edition):

-0613-6243. “A computational framework for the solution of infinite-dimensional Bayesian statistical inverse problems with application to global seismic inversion.” 2015. Web. 21 Apr 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-0613-6243. A computational framework for the solution of infinite-dimensional Bayesian statistical inverse problems with application to global seismic inversion. [Internet] [Thesis]. University of Texas – Austin; 2015. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/2152/31374.

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

Council of Science Editors:

-0613-6243. A computational framework for the solution of infinite-dimensional Bayesian statistical inverse problems with application to global seismic inversion. [Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/31374

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


University of New Mexico

16. Jones, Thomas B. Criticality Assessments for Improving Algorithmic Robustness.

Degree: Department of Computer Science, 2018, University of New Mexico

  Though computational models typically assume all program steps execute flawlessly, that does not imply all steps are equally important if a failure should occur.… (more)

Subjects/Keywords: Criticality; Failure Interface; Failure Shaping; Fault Tolerance; Quantified Correctness; Scalable Robustness; Computer and Systems Architecture; Hardware Systems; Other Computer Engineering; Software Engineering; Systems Architecture; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jones, T. B. (2018). Criticality Assessments for Improving Algorithmic Robustness. (Doctoral Dissertation). University of New Mexico. Retrieved from https://digitalrepository.unm.edu/cs_etds/96

Chicago Manual of Style (16th Edition):

Jones, Thomas B. “Criticality Assessments for Improving Algorithmic Robustness.” 2018. Doctoral Dissertation, University of New Mexico. Accessed April 21, 2019. https://digitalrepository.unm.edu/cs_etds/96.

MLA Handbook (7th Edition):

Jones, Thomas B. “Criticality Assessments for Improving Algorithmic Robustness.” 2018. Web. 21 Apr 2019.

Vancouver:

Jones TB. Criticality Assessments for Improving Algorithmic Robustness. [Internet] [Doctoral dissertation]. University of New Mexico; 2018. [cited 2019 Apr 21]. Available from: https://digitalrepository.unm.edu/cs_etds/96.

Council of Science Editors:

Jones TB. Criticality Assessments for Improving Algorithmic Robustness. [Doctoral Dissertation]. University of New Mexico; 2018. Available from: https://digitalrepository.unm.edu/cs_etds/96


University of Oxford

17. Bernabeu Llinares, Miguel Oscar. An open source HPC-enabled model of cardiac defibrillation of the human heart.

Degree: PhD, 2011, University of Oxford

 Sudden cardiac death following cardiac arrest is a major killer in the industrialised world. The leading cause of sudden cardiac death are disturbances in the… (more)

Subjects/Keywords: 616.1280645; Applications and algorithms; Numerical analysis; Program development and tools; Scalable systems; Software engineering; Biomedical engineering; Numerical analysis; Partial differential equations; Cardiovascular disease; Physiology; computational cardiac electrophysiology; cardiac defibrillation; bidomain equations; finite element method; parallel computing; linear solvers; preconditioning; software engineering; Chaste

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bernabeu Llinares, M. O. (2011). An open source HPC-enabled model of cardiac defibrillation of the human heart. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:9ca44896-8873-4c91-9358-96744e28d187 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572834

Chicago Manual of Style (16th Edition):

Bernabeu Llinares, Miguel Oscar. “An open source HPC-enabled model of cardiac defibrillation of the human heart.” 2011. Doctoral Dissertation, University of Oxford. Accessed April 21, 2019. http://ora.ox.ac.uk/objects/uuid:9ca44896-8873-4c91-9358-96744e28d187 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572834.

MLA Handbook (7th Edition):

Bernabeu Llinares, Miguel Oscar. “An open source HPC-enabled model of cardiac defibrillation of the human heart.” 2011. Web. 21 Apr 2019.

Vancouver:

Bernabeu Llinares MO. An open source HPC-enabled model of cardiac defibrillation of the human heart. [Internet] [Doctoral dissertation]. University of Oxford; 2011. [cited 2019 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:9ca44896-8873-4c91-9358-96744e28d187 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572834.

Council of Science Editors:

Bernabeu Llinares MO. An open source HPC-enabled model of cardiac defibrillation of the human heart. [Doctoral Dissertation]. University of Oxford; 2011. Available from: http://ora.ox.ac.uk/objects/uuid:9ca44896-8873-4c91-9358-96744e28d187 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572834


Indian Institute of Science

18. Dwivedi, Satyam. Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks.

Degree: 2010, Indian Institute of Science

 Sensor nodes in a sensor network is power constrained. Transceiver electronics of a node in sensor network consume a good share of total power consumed… (more)

Subjects/Keywords: Wireless Receiving Sets; Algorithms; Personal Receiving Sets; Wireless Personal Area Networks; Wireless Sensor Networks; Power Receiver Architecture; Power Scalable Receiver; IEEE 802.15.4; Low Power Radio Receiver; Low Power Receiver Architecture; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dwivedi, S. (2010). Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2228

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

Dwivedi, Satyam. “Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks.” 2010. Thesis, Indian Institute of Science. Accessed April 21, 2019. http://hdl.handle.net/2005/2228.

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

MLA Handbook (7th Edition):

Dwivedi, Satyam. “Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks.” 2010. Web. 21 Apr 2019.

Vancouver:

Dwivedi S. Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/2005/2228.

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

Council of Science Editors:

Dwivedi S. Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks. [Thesis]. Indian Institute of Science; 2010. Available from: http://hdl.handle.net/2005/2228

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


University of Oxford

19. Calliess, Jan-Peter. Conservative decision-making and inference in uncertain dynamical systems.

Degree: PhD, 2014, University of Oxford

 The demand for automated decision making, learning and inference in uncertain, risk sensitive and dynamically changing situations presents a challenge: to design computational approaches that… (more)

Subjects/Keywords: 629.8; Information engineering; Control engineering; Robotics; Difference and functional equations; Dynamical systems and ergodic theory (mathematics); Scalable systems; Applications and algorithms; Decision science; Vehicle guidance (information eng); Operations research,mathematical programming; Artificial Intelligence; Machine Learning; Control; Multiagent Systems; Optimisation; Collision Avoidance; Dynamical Systems; System Identification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Calliess, J. (2014). Conservative decision-making and inference in uncertain dynamical systems. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b7206c3a-8d76-4454-a258-ea1e5bd1c63e ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664847

Chicago Manual of Style (16th Edition):

Calliess, Jan-Peter. “Conservative decision-making and inference in uncertain dynamical systems.” 2014. Doctoral Dissertation, University of Oxford. Accessed April 21, 2019. http://ora.ox.ac.uk/objects/uuid:b7206c3a-8d76-4454-a258-ea1e5bd1c63e ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664847.

MLA Handbook (7th Edition):

Calliess, Jan-Peter. “Conservative decision-making and inference in uncertain dynamical systems.” 2014. Web. 21 Apr 2019.

Vancouver:

Calliess J. Conservative decision-making and inference in uncertain dynamical systems. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:b7206c3a-8d76-4454-a258-ea1e5bd1c63e ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664847.

Council of Science Editors:

Calliess J. Conservative decision-making and inference in uncertain dynamical systems. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:b7206c3a-8d76-4454-a258-ea1e5bd1c63e ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664847


Indian Institute of Science

20. Dwivedi, Satyam. Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks.

Degree: 2010, Indian Institute of Science

 Sensor nodes in a sensor network is power constrained. Transceiver electronics of a node in sensor network consume a good share of total power consumed… (more)

Subjects/Keywords: Wireless Receiving Sets; Algorithms; Personal Receiving Sets; Wireless Personal Area Networks; Wireless Sensor Networks; Power Receiver Architecture; Power Scalable Receiver; IEEE 802.15.4; Low Power Radio Receiver; Low Power Receiver Architecture; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dwivedi, S. (2010). Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2228 ; http://etd.ncsi.iisc.ernet.in/abstracts/2841/G24790-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):

Dwivedi, Satyam. “Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks.” 2010. Thesis, Indian Institute of Science. Accessed April 21, 2019. http://etd.iisc.ernet.in/handle/2005/2228 ; http://etd.ncsi.iisc.ernet.in/abstracts/2841/G24790-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):

Dwivedi, Satyam. “Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks.” 2010. Web. 21 Apr 2019.

Vancouver:

Dwivedi S. Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2019 Apr 21]. Available from: http://etd.iisc.ernet.in/handle/2005/2228 ; http://etd.ncsi.iisc.ernet.in/abstracts/2841/G24790-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:

Dwivedi S. Low Power Receiver Architecture And Algorithms For Low Data Rate Wireless Personal Area Networks. [Thesis]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ernet.in/handle/2005/2228 ; http://etd.ncsi.iisc.ernet.in/abstracts/2841/G24790-Abs.pdf

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


University of Florida

21. Chung, Sung. Enhanced Distributed Multimedia Services Using Advanced Network Technologies.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2010, University of Florida

 A variety of enhanced multimedia services, including multimedia live streaming and high-quality content sharing, have been enabled by the recent advances in network, storage, and… (more)

Subjects/Keywords: Algorithms; Architectural design; Community structure; Linear programming; Multimedia materials; Scalability; Simulations; Streaming; Television programs; Topology; architecture, content, design, distributed, fcal, high, loop, msg, mst, multimedia, multiple, p2p, pvr, quality, scalable, services, sharing, systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chung, S. (2010). Enhanced Distributed Multimedia Services Using Advanced Network Technologies. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0042024

Chicago Manual of Style (16th Edition):

Chung, Sung. “Enhanced Distributed Multimedia Services Using Advanced Network Technologies.” 2010. Doctoral Dissertation, University of Florida. Accessed April 21, 2019. http://ufdc.ufl.edu/UFE0042024.

MLA Handbook (7th Edition):

Chung, Sung. “Enhanced Distributed Multimedia Services Using Advanced Network Technologies.” 2010. Web. 21 Apr 2019.

Vancouver:

Chung S. Enhanced Distributed Multimedia Services Using Advanced Network Technologies. [Internet] [Doctoral dissertation]. University of Florida; 2010. [cited 2019 Apr 21]. Available from: http://ufdc.ufl.edu/UFE0042024.

Council of Science Editors:

Chung S. Enhanced Distributed Multimedia Services Using Advanced Network Technologies. [Doctoral Dissertation]. University of Florida; 2010. Available from: http://ufdc.ufl.edu/UFE0042024

22. Udupa, Pramod. Algorithmes parallèles et architectures évolutives de faible complexité pour systèmes optiques OFDM cohérents temps réel : Low-Complexity Parallel Algorithms and Scalable Architectures for Real-Time Coherent Optical OFDM Systems.

Degree: Docteur es, Traitement du signal et télécommunications, 2014, Rennes 1

Dans cette thèse, des algorithmes à faible complexité et des architectures parallèles et efficaces sont explorés pour les systèmes CO-OFDM. Tout d'abord, des algorithmes de… (more)

Subjects/Keywords: Ofdm; Détection cohérente; Algorithmes de faible complexité; Architectures parallèles évolutives; Fpga; Convertisseurs de signaux; Point fixe calcul; Ofdm; Coherent detection; Low-complexity algorithms; Scalable parallel architectures; Fpga; Signal converters; Fixed-point computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Udupa, P. (2014). Algorithmes parallèles et architectures évolutives de faible complexité pour systèmes optiques OFDM cohérents temps réel : Low-Complexity Parallel Algorithms and Scalable Architectures for Real-Time Coherent Optical OFDM Systems. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2014REN1S039

Chicago Manual of Style (16th Edition):

Udupa, Pramod. “Algorithmes parallèles et architectures évolutives de faible complexité pour systèmes optiques OFDM cohérents temps réel : Low-Complexity Parallel Algorithms and Scalable Architectures for Real-Time Coherent Optical OFDM Systems.” 2014. Doctoral Dissertation, Rennes 1. Accessed April 21, 2019. http://www.theses.fr/2014REN1S039.

MLA Handbook (7th Edition):

Udupa, Pramod. “Algorithmes parallèles et architectures évolutives de faible complexité pour systèmes optiques OFDM cohérents temps réel : Low-Complexity Parallel Algorithms and Scalable Architectures for Real-Time Coherent Optical OFDM Systems.” 2014. Web. 21 Apr 2019.

Vancouver:

Udupa P. Algorithmes parallèles et architectures évolutives de faible complexité pour systèmes optiques OFDM cohérents temps réel : Low-Complexity Parallel Algorithms and Scalable Architectures for Real-Time Coherent Optical OFDM Systems. [Internet] [Doctoral dissertation]. Rennes 1; 2014. [cited 2019 Apr 21]. Available from: http://www.theses.fr/2014REN1S039.

Council of Science Editors:

Udupa P. Algorithmes parallèles et architectures évolutives de faible complexité pour systèmes optiques OFDM cohérents temps réel : Low-Complexity Parallel Algorithms and Scalable Architectures for Real-Time Coherent Optical OFDM Systems. [Doctoral Dissertation]. Rennes 1; 2014. Available from: http://www.theses.fr/2014REN1S039

23. ZHU JIA. Complexity-scalable bit detection with MP3 audio bitstreams.

Degree: 2008, National University of Singapore

Subjects/Keywords: MP3; compressed domain; music processing; beat detection; low-power computation; memory- and energy-efficient algorithms; complexity-scalable

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

JIA, Z. (2008). Complexity-scalable bit detection with MP3 audio bitstreams. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/16115 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/2/bitstream

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

JIA, ZHU. “Complexity-scalable bit detection with MP3 audio bitstreams.” 2008. Thesis, National University of Singapore. Accessed April 21, 2019. http://scholarbank.nus.edu.sg/handle/10635/16115 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/2/bitstream.

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

MLA Handbook (7th Edition):

JIA, ZHU. “Complexity-scalable bit detection with MP3 audio bitstreams.” 2008. Web. 21 Apr 2019.

Vancouver:

JIA Z. Complexity-scalable bit detection with MP3 audio bitstreams. [Internet] [Thesis]. National University of Singapore; 2008. [cited 2019 Apr 21]. Available from: http://scholarbank.nus.edu.sg/handle/10635/16115 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/2/bitstream.

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

Council of Science Editors:

JIA Z. Complexity-scalable bit detection with MP3 audio bitstreams. [Thesis]. National University of Singapore; 2008. Available from: http://scholarbank.nus.edu.sg/handle/10635/16115 ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/1/bitstream ; http://scholarbank.nus.edu.sg/bitstream/10635%2F16115/2/bitstream

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


Vrije Universiteit Amsterdam

24. Kotoulas, S. Scalable discovery of networked data : Algorithms, Infrastructure, Applications .

Degree: 2010, Vrije Universiteit Amsterdam

Subjects/Keywords: Scalable discovery of networked data: algorithms, infrastructure, application; Peer-to-peer; Scalability; Distributed computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kotoulas, S. (2010). Scalable discovery of networked data : Algorithms, Infrastructure, Applications . (Doctoral Dissertation). Vrije Universiteit Amsterdam. Retrieved from http://hdl.handle.net/1871/15756

Chicago Manual of Style (16th Edition):

Kotoulas, S. “Scalable discovery of networked data : Algorithms, Infrastructure, Applications .” 2010. Doctoral Dissertation, Vrije Universiteit Amsterdam. Accessed April 21, 2019. http://hdl.handle.net/1871/15756.

MLA Handbook (7th Edition):

Kotoulas, S. “Scalable discovery of networked data : Algorithms, Infrastructure, Applications .” 2010. Web. 21 Apr 2019.

Vancouver:

Kotoulas S. Scalable discovery of networked data : Algorithms, Infrastructure, Applications . [Internet] [Doctoral dissertation]. Vrije Universiteit Amsterdam; 2010. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/1871/15756.

Council of Science Editors:

Kotoulas S. Scalable discovery of networked data : Algorithms, Infrastructure, Applications . [Doctoral Dissertation]. Vrije Universiteit Amsterdam; 2010. Available from: http://hdl.handle.net/1871/15756


Indian Institute of Science

25. Kalaiselvi, S. Checkpointing Algorithms for Parallel Computers.

Degree: 1997, Indian Institute of Science

 Checkpointing is a technique widely used in parallel/distributed computers for rollback error recovery. Checkpointing is defined as the coordinated saving of process state information at… (more)

Subjects/Keywords: Computer and Information Science; Parallel Computers; Parallel Program; Checkpointing Algorithms; Scalable Coherent Interface (SCI); Static Checkpointing Algorithms; Distributed Shared Memory (DSM); Uniprocessor Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalaiselvi, S. (1997). Checkpointing Algorithms for Parallel Computers. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/67

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

Kalaiselvi, S. “Checkpointing Algorithms for Parallel Computers.” 1997. Thesis, Indian Institute of Science. Accessed April 21, 2019. http://hdl.handle.net/2005/67.

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

MLA Handbook (7th Edition):

Kalaiselvi, S. “Checkpointing Algorithms for Parallel Computers.” 1997. Web. 21 Apr 2019.

Vancouver:

Kalaiselvi S. Checkpointing Algorithms for Parallel Computers. [Internet] [Thesis]. Indian Institute of Science; 1997. [cited 2019 Apr 21]. Available from: http://hdl.handle.net/2005/67.

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

Council of Science Editors:

Kalaiselvi S. Checkpointing Algorithms for Parallel Computers. [Thesis]. Indian Institute of Science; 1997. Available from: http://hdl.handle.net/2005/67

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


University of Oxford

26. Nakrani, Sunil. Biomimetic and autonomic server ensemble orchestration.

Degree: 2005, University of Oxford

 This thesis addresses orchestration of servers amongst multiple co-hosted internet services such as e-Banking, e-Auction and e-Retail in hosting centres. The hosting paradigm entails levying… (more)

Subjects/Keywords: 621.382; Biology and other natural sciences (mathematics) : Computer science (mathematics) : Operations research,mathematical programming : Mathematical biology : Decision science : Computing : Applications and algorithms : Scalable systems : Mathematical modeling (engineering) : Data Centre : Server Allocation Algorithm : Biomimicry : Biomimesis : Biomimetic : Nature-Inspired Computing : Bio-Inspired Computing : Self-Organising Algorithms : Mathematics : Operation Research : Behavioural Biology : Social Insects

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nakrani, S. (2005). Biomimetic and autonomic server ensemble orchestration. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:289d186f-c426-42a8-812e-51d7b856d5e5 : http://www.bcs.org/content/conMediaFile/4501 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.534214

Chicago Manual of Style (16th Edition):

Nakrani, Sunil. “Biomimetic and autonomic server ensemble orchestration.” 2005. Doctoral Dissertation, University of Oxford. Accessed April 21, 2019. http://ora.ox.ac.uk/objects/uuid:289d186f-c426-42a8-812e-51d7b856d5e5 : http://www.bcs.org/content/conMediaFile/4501 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.534214.

MLA Handbook (7th Edition):

Nakrani, Sunil. “Biomimetic and autonomic server ensemble orchestration.” 2005. Web. 21 Apr 2019.

Vancouver:

Nakrani S. Biomimetic and autonomic server ensemble orchestration. [Internet] [Doctoral dissertation]. University of Oxford; 2005. [cited 2019 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:289d186f-c426-42a8-812e-51d7b856d5e5 : http://www.bcs.org/content/conMediaFile/4501 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.534214.

Council of Science Editors:

Nakrani S. Biomimetic and autonomic server ensemble orchestration. [Doctoral Dissertation]. University of Oxford; 2005. Available from: http://ora.ox.ac.uk/objects/uuid:289d186f-c426-42a8-812e-51d7b856d5e5 : http://www.bcs.org/content/conMediaFile/4501 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.534214


University of Oxford

27. Ramraj, Varun. Exploiting whole-PDB analysis in novel bioinformatics applications.

Degree: PhD, 2014, University of Oxford

 The Protein Data Bank (PDB) is the definitive electronic repository for experimentally-derived protein structures, composed mainly of those determined by X-ray crystallography. Approximately 200 new… (more)

Subjects/Keywords: 572.80285; Medical Sciences; Computer science (mathematics); Bioinformatics (biochemistry); Life Sciences; Genetics (life sciences); Computational biochemistry; Bioinformatics (life sciences); Biology (medical sciences); Genetics (medical sciences); Structural genomics; Crystallography; Enzymes; Membrane proteins; Protein chemistry; Protein folding; Polymers Amino acid and peptide chemistry; NMR spectroscopy; Mass spectrometry; Chemistry & allied sciences; Physical Sciences; Mathematical genetics and bioinformatics (statistics); Computationally-intensive statistics; Bioinformatics (technology); Computing; Applications and algorithms; Program development and tools; Scalable systems; Software engineering; Theory and automated verification; Biomedical engineering; protein data bank; structural biology; bioinformatics; clustering; disorder prediction; unit cell; space group; OpenMP; parallelization; proteins; peptides; fragments; training; neural network; MoreRONN; nearest cell; nearest-cell

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramraj, V. (2014). Exploiting whole-PDB analysis in novel bioinformatics applications. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:6c59c813-2a4c-440c-940b-d334c02dd075 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618510

Chicago Manual of Style (16th Edition):

Ramraj, Varun. “Exploiting whole-PDB analysis in novel bioinformatics applications.” 2014. Doctoral Dissertation, University of Oxford. Accessed April 21, 2019. http://ora.ox.ac.uk/objects/uuid:6c59c813-2a4c-440c-940b-d334c02dd075 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618510.

MLA Handbook (7th Edition):

Ramraj, Varun. “Exploiting whole-PDB analysis in novel bioinformatics applications.” 2014. Web. 21 Apr 2019.

Vancouver:

Ramraj V. Exploiting whole-PDB analysis in novel bioinformatics applications. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Apr 21]. Available from: http://ora.ox.ac.uk/objects/uuid:6c59c813-2a4c-440c-940b-d334c02dd075 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618510.

Council of Science Editors:

Ramraj V. Exploiting whole-PDB analysis in novel bioinformatics applications. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:6c59c813-2a4c-440c-940b-d334c02dd075 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618510

.