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:(Concurrent algorithms AND data structures). Showing records 1 – 30 of 1042 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Waterloo

1. Pratt, Simon. Three Approaches to Building Time-Windowed Geometric Data Structures.

Degree: 2016, University of Waterloo

 Given a set of geometric objects (points or line segments) each associated with a time value, we wish to determine whether a given property is… (more)

Subjects/Keywords: computational geometry; geometric data structures; data structures; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pratt, S. (2016). Three Approaches to Building Time-Windowed Geometric Data Structures. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10654

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

Pratt, Simon. “Three Approaches to Building Time-Windowed Geometric Data Structures.” 2016. Thesis, University of Waterloo. Accessed January 20, 2020. http://hdl.handle.net/10012/10654.

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

MLA Handbook (7th Edition):

Pratt, Simon. “Three Approaches to Building Time-Windowed Geometric Data Structures.” 2016. Web. 20 Jan 2020.

Vancouver:

Pratt S. Three Approaches to Building Time-Windowed Geometric Data Structures. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10012/10654.

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

Council of Science Editors:

Pratt S. Three Approaches to Building Time-Windowed Geometric Data Structures. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10654

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


University of Illinois – Urbana-Champaign

2. Kumar, Nirman. In search of better proximity.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

 Given a set of points in a metric space, a fundamental problem is to preprocess these points for answering nearest-neighbor queries on them. Proximity search… (more)

Subjects/Keywords: Computational Geometry; Algorithms; Data-Structures; Nearest-Neighbor Search; Approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, N. (2014). In search of better proximity. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50535

Chicago Manual of Style (16th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 20, 2020. http://hdl.handle.net/2142/50535.

MLA Handbook (7th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Web. 20 Jan 2020.

Vancouver:

Kumar N. In search of better proximity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/2142/50535.

Council of Science Editors:

Kumar N. In search of better proximity. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50535


Victoria University of Wellington

3. Doherty, Simon. The Design and Verification of Dynamic-sized Nonblocking Data Structures.

Degree: 2010, Victoria University of Wellington

 Modern computer systems often involve multiple processes or threads of control that communicate through shared memory. However, the implementation of correct and efficient data structures(more)

Subjects/Keywords: Computer algorithms; Verification; Memory management; Nonblocking algorithms; Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doherty, S. (2010). The Design and Verification of Dynamic-sized Nonblocking Data Structures. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1239

Chicago Manual of Style (16th Edition):

Doherty, Simon. “The Design and Verification of Dynamic-sized Nonblocking Data Structures.” 2010. Doctoral Dissertation, Victoria University of Wellington. Accessed January 20, 2020. http://hdl.handle.net/10063/1239.

MLA Handbook (7th Edition):

Doherty, Simon. “The Design and Verification of Dynamic-sized Nonblocking Data Structures.” 2010. Web. 20 Jan 2020.

Vancouver:

Doherty S. The Design and Verification of Dynamic-sized Nonblocking Data Structures. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2010. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10063/1239.

Council of Science Editors:

Doherty S. The Design and Verification of Dynamic-sized Nonblocking Data Structures. [Doctoral Dissertation]. Victoria University of Wellington; 2010. Available from: http://hdl.handle.net/10063/1239

4. Lammersen, Christiane. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.

Degree: 2010, Technische Universität Dortmund

 This thesis addresses the development of geometric approximation algorithms for huge datasets and is subdivided into two parts. The first part deals with algorithms for… (more)

Subjects/Keywords: approximation algorithms; clustering; distributed algorithms; embedding; facility location; kinetic data structures; streaming algorithms; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lammersen, C. (2010). Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27597

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

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Thesis, Technische Universität Dortmund. Accessed January 20, 2020. http://hdl.handle.net/2003/27597.

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

MLA Handbook (7th Edition):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Web. 20 Jan 2020.

Vancouver:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Internet] [Thesis]. Technische Universität Dortmund; 2010. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/2003/27597.

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

Council of Science Editors:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Thesis]. Technische Universität Dortmund; 2010. Available from: http://hdl.handle.net/2003/27597

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

5. Tacla Saad, Rodrigo. Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur.

Degree: Docteur es, Sûreté de logiciel et calcul de haute performance, 2011, Toulouse, INSA

Nous proposons de nouveaux algorithmes et de nouvelles structures de données pour la vérification formelle de systèmes réactifs finis sur architectures parallèles. Ces travaux se… (more)

Subjects/Keywords: Model Checking en Parallèle; Vérification Formelle et Logiques Temporelles; Algorithme et Structure de Données concurrents; Méthode Formelle; Parallel Model Checking; Concurrent algorithms and data structures; Formal Verification and Temporal Logic; Formal Methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tacla Saad, R. (2011). Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur. (Doctoral Dissertation). Toulouse, INSA. Retrieved from http://www.theses.fr/2011ISAT0028

Chicago Manual of Style (16th Edition):

Tacla Saad, Rodrigo. “Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur.” 2011. Doctoral Dissertation, Toulouse, INSA. Accessed January 20, 2020. http://www.theses.fr/2011ISAT0028.

MLA Handbook (7th Edition):

Tacla Saad, Rodrigo. “Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur.” 2011. Web. 20 Jan 2020.

Vancouver:

Tacla Saad R. Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur. [Internet] [Doctoral dissertation]. Toulouse, INSA; 2011. [cited 2020 Jan 20]. Available from: http://www.theses.fr/2011ISAT0028.

Council of Science Editors:

Tacla Saad R. Parallel model checking for multiprocessor architecture : Model checking sur architecture multiprocesseur. [Doctoral Dissertation]. Toulouse, INSA; 2011. Available from: http://www.theses.fr/2011ISAT0028

6. Salikhov, Kamil. Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data.

Degree: Docteur es, Informatique, 2017, Université Paris-Est

Les volumes des données générées par les technologies de séquençage haut débit augmentent exponentiellement ce dernier temps. Le stockage, le traitement et le transfertdeviennent des… (more)

Subjects/Keywords: Structures de données; Algorithmes; L’indexation de séquences d’ADN; Data structures; Algorithms; DNA sequence data

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Salikhov, K. (2017). Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2017PESC1232

Chicago Manual of Style (16th Edition):

Salikhov, Kamil. “Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data.” 2017. Doctoral Dissertation, Université Paris-Est. Accessed January 20, 2020. http://www.theses.fr/2017PESC1232.

MLA Handbook (7th Edition):

Salikhov, Kamil. “Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data.” 2017. Web. 20 Jan 2020.

Vancouver:

Salikhov K. Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data. [Internet] [Doctoral dissertation]. Université Paris-Est; 2017. [cited 2020 Jan 20]. Available from: http://www.theses.fr/2017PESC1232.

Council of Science Editors:

Salikhov K. Algorithmes et structures de données efficaces pour l’indexation de séquences d’ADN : Efficient algorithms and data structures for indexing DNA sequence data. [Doctoral Dissertation]. Université Paris-Est; 2017. Available from: http://www.theses.fr/2017PESC1232

7. Maria, Clément. Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology.

Degree: Docteur es, Informatique, 2014, Nice

La théorie de l'homologie généralise en dimensions supérieures la notion de connectivité dans les graphes. Étant donné un domaine, décrit par un complexe simplicial, elle… (more)

Subjects/Keywords: Algorithmes; Structures de données; Complexes simpliciaux; Homologie persistante; Algorithms; Data structures; Simplicial complexes; Persistent homology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maria, C. (2014). Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology. (Doctoral Dissertation). Nice. Retrieved from http://www.theses.fr/2014NICE4081

Chicago Manual of Style (16th Edition):

Maria, Clément. “Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology.” 2014. Doctoral Dissertation, Nice. Accessed January 20, 2020. http://www.theses.fr/2014NICE4081.

MLA Handbook (7th Edition):

Maria, Clément. “Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology.” 2014. Web. 20 Jan 2020.

Vancouver:

Maria C. Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology. [Internet] [Doctoral dissertation]. Nice; 2014. [cited 2020 Jan 20]. Available from: http://www.theses.fr/2014NICE4081.

Council of Science Editors:

Maria C. Algorithmes et structures de données en topologie algorithmique : Algorithms and data structures in computational topology. [Doctoral Dissertation]. Nice; 2014. Available from: http://www.theses.fr/2014NICE4081


Univerzitet u Beogradu

8. Damjanović, Boris S., 1965-. Adaptibilna primjena AES algoritma kod savremenih operativnih sistema.

Degree: Fakultet organizacionih nauka, 2016, Univerzitet u Beogradu

Tehničke nauke - Informacione tehnologije / Technical sciences - Information technologies

Današnji kriptografski algoritmi su dizajnirani tako da kombinuju složene matematičke postupke sa teorijom i… (more)

Subjects/Keywords: cryptography; algorithms; data structures and algorithms; AES, computer systems security; adaptable operating systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Damjanović, Boris S., 1. (2016). Adaptibilna primjena AES algoritma kod savremenih operativnih sistema. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:13116/bdef:Content/get

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

Damjanović, Boris S., 1965-. “Adaptibilna primjena AES algoritma kod savremenih operativnih sistema.” 2016. Thesis, Univerzitet u Beogradu. Accessed January 20, 2020. https://fedorabg.bg.ac.rs/fedora/get/o:13116/bdef:Content/get.

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

MLA Handbook (7th Edition):

Damjanović, Boris S., 1965-. “Adaptibilna primjena AES algoritma kod savremenih operativnih sistema.” 2016. Web. 20 Jan 2020.

Vancouver:

Damjanović, Boris S. 1. Adaptibilna primjena AES algoritma kod savremenih operativnih sistema. [Internet] [Thesis]. Univerzitet u Beogradu; 2016. [cited 2020 Jan 20]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:13116/bdef:Content/get.

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

Council of Science Editors:

Damjanović, Boris S. 1. Adaptibilna primjena AES algoritma kod savremenih operativnih sistema. [Thesis]. Univerzitet u Beogradu; 2016. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:13116/bdef:Content/get

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


University of Minnesota

9. Li, Yuan. Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems.

Degree: PhD, Computer Science, 2017, University of Minnesota

 Problems arising in diverse real-world applications can often be modeled by geometric objects such as points, lines, and polygons. The goal of this dissertation research… (more)

Subjects/Keywords: algorithms; computational geometry; data structures; preference queries; proximity search; stochasticity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Y. (2017). Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/190539

Chicago Manual of Style (16th Edition):

Li, Yuan. “Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems.” 2017. Doctoral Dissertation, University of Minnesota. Accessed January 20, 2020. http://hdl.handle.net/11299/190539.

MLA Handbook (7th Edition):

Li, Yuan. “Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems.” 2017. Web. 20 Jan 2020.

Vancouver:

Li Y. Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/11299/190539.

Council of Science Editors:

Li Y. Efficient geometric algorithms for preference top-k queries, stochastic line arrangements, and proximity problems. [Doctoral Dissertation]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/190539


Ryerson University

10. El-Aooiti, Amir. Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers.

Degree: 2017, Ryerson University

 Although Constraint Satisfaction Problems (CSPs) are generally known to be NP-complete, placing restrictions on the constraint template can yield tractable subclasses. By studying the operations… (more)

Subjects/Keywords: Constraint programming (Computer science); Computer algorithms; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

El-Aooiti, A. (2017). Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A6933

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

El-Aooiti, Amir. “Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers.” 2017. Thesis, Ryerson University. Accessed January 20, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A6933.

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

MLA Handbook (7th Edition):

El-Aooiti, Amir. “Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers.” 2017. Web. 20 Jan 2020.

Vancouver:

El-Aooiti A. Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers. [Internet] [Thesis]. Ryerson University; 2017. [cited 2020 Jan 20]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6933.

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

Council of Science Editors:

El-Aooiti A. Circuit Complexity Of Constraint Satisfaction Problems With Few Subpowers. [Thesis]. Ryerson University; 2017. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A6933

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


Ryerson University

11. Somers, Vijay. Implementation of a novel reactive navigation algorithm.

Degree: 2007, Ryerson University

 In this project a reactive navigation algorithm is applied to a non-holonomic differential drive robot. The algorithm uses a stochastic process to navigate a robot… (more)

Subjects/Keywords: Algorithms; Data structures; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Somers, V. (2007). Implementation of a novel reactive navigation algorithm. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A843

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

Somers, Vijay. “Implementation of a novel reactive navigation algorithm.” 2007. Thesis, Ryerson University. Accessed January 20, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A843.

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

MLA Handbook (7th Edition):

Somers, Vijay. “Implementation of a novel reactive navigation algorithm.” 2007. Web. 20 Jan 2020.

Vancouver:

Somers V. Implementation of a novel reactive navigation algorithm. [Internet] [Thesis]. Ryerson University; 2007. [cited 2020 Jan 20]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A843.

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

Council of Science Editors:

Somers V. Implementation of a novel reactive navigation algorithm. [Thesis]. Ryerson University; 2007. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A843

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

12. Ramachandra, Preethi Modur. Compressive sensing based imaging via belief propagation.

Degree: 2012, University of Tennessee – Chattanooga

 Multiple description coding (MDC) using Compressive Sensing (CS) mainly aims at restoring an image from a small subset of samples with reasonable accuracy using an… (more)

Subjects/Keywords: Computer algorithms; Data structures (Computer science); Signal processing  – Digital techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramachandra, P. M. (2012). Compressive sensing based imaging via belief propagation. (Masters Thesis). University of Tennessee – Chattanooga. Retrieved from https://scholar.utc.edu/theses/62

Chicago Manual of Style (16th Edition):

Ramachandra, Preethi Modur. “Compressive sensing based imaging via belief propagation.” 2012. Masters Thesis, University of Tennessee – Chattanooga. Accessed January 20, 2020. https://scholar.utc.edu/theses/62.

MLA Handbook (7th Edition):

Ramachandra, Preethi Modur. “Compressive sensing based imaging via belief propagation.” 2012. Web. 20 Jan 2020.

Vancouver:

Ramachandra PM. Compressive sensing based imaging via belief propagation. [Internet] [Masters thesis]. University of Tennessee – Chattanooga; 2012. [cited 2020 Jan 20]. Available from: https://scholar.utc.edu/theses/62.

Council of Science Editors:

Ramachandra PM. Compressive sensing based imaging via belief propagation. [Masters Thesis]. University of Tennessee – Chattanooga; 2012. Available from: https://scholar.utc.edu/theses/62


Clemson University

13. Suresh, Rahul. An efficient image segmentation algorithm using bidirectional Mahalanobis distance.

Degree: MS, Electrical Engineering, 2012, Clemson University

 In this thesis, we present an efficient graph-based image-segmentation algorithm that improves upon the drawbacks of the minimum spanning tree based segmentation algorithm, namely leaks… (more)

Subjects/Keywords: Computer Vision; Data Structures; Graph Algorithms; Image Processing; Segmentation; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Suresh, R. (2012). An efficient image segmentation algorithm using bidirectional Mahalanobis distance. (Masters Thesis). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_theses/1556

Chicago Manual of Style (16th Edition):

Suresh, Rahul. “An efficient image segmentation algorithm using bidirectional Mahalanobis distance.” 2012. Masters Thesis, Clemson University. Accessed January 20, 2020. https://tigerprints.clemson.edu/all_theses/1556.

MLA Handbook (7th Edition):

Suresh, Rahul. “An efficient image segmentation algorithm using bidirectional Mahalanobis distance.” 2012. Web. 20 Jan 2020.

Vancouver:

Suresh R. An efficient image segmentation algorithm using bidirectional Mahalanobis distance. [Internet] [Masters thesis]. Clemson University; 2012. [cited 2020 Jan 20]. Available from: https://tigerprints.clemson.edu/all_theses/1556.

Council of Science Editors:

Suresh R. An efficient image segmentation algorithm using bidirectional Mahalanobis distance. [Masters Thesis]. Clemson University; 2012. Available from: https://tigerprints.clemson.edu/all_theses/1556


University of Houston

14. Guo, Wei 1983-. Integrating a Preprocessor Based on Unification in the Laboratory for Rapid Rewriting.

Degree: Computer Science, Department of, 2013, University of Houston

 In normalization, traversing the term to find a match with a rule costs most of the time. This thesis presents the design, implementation, and integration… (more)

Subjects/Keywords: Term Rewriting; Unification-based preprocessing; Data Structures and Algorithms for Normalization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, W. 1. (2013). Integrating a Preprocessor Based on Unification in the Laboratory for Rapid Rewriting. (Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/3286

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

Guo, Wei 1983-. “Integrating a Preprocessor Based on Unification in the Laboratory for Rapid Rewriting.” 2013. Thesis, University of Houston. Accessed January 20, 2020. http://hdl.handle.net/10657/3286.

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

MLA Handbook (7th Edition):

Guo, Wei 1983-. “Integrating a Preprocessor Based on Unification in the Laboratory for Rapid Rewriting.” 2013. Web. 20 Jan 2020.

Vancouver:

Guo W1. Integrating a Preprocessor Based on Unification in the Laboratory for Rapid Rewriting. [Internet] [Thesis]. University of Houston; 2013. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10657/3286.

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

Council of Science Editors:

Guo W1. Integrating a Preprocessor Based on Unification in the Laboratory for Rapid Rewriting. [Thesis]. University of Houston; 2013. Available from: http://hdl.handle.net/10657/3286

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

15. El-Zein, Hicham. Space Efficient Data Structures and Algorithms in the Word-RAM Model.

Degree: 2018, University of Waterloo

 In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement… (more)

Subjects/Keywords: Algorithms; Data Structures; Space Efficient; Range Searching; Permutations

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

El-Zein, H. (2018). Space Efficient Data Structures and Algorithms in the Word-RAM Model. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13200

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

El-Zein, Hicham. “Space Efficient Data Structures and Algorithms in the Word-RAM Model.” 2018. Thesis, University of Waterloo. Accessed January 20, 2020. http://hdl.handle.net/10012/13200.

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

MLA Handbook (7th Edition):

El-Zein, Hicham. “Space Efficient Data Structures and Algorithms in the Word-RAM Model.” 2018. Web. 20 Jan 2020.

Vancouver:

El-Zein H. Space Efficient Data Structures and Algorithms in the Word-RAM Model. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10012/13200.

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

Council of Science Editors:

El-Zein H. Space Efficient Data Structures and Algorithms in the Word-RAM Model. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13200

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


University of Waterloo

16. Chen, Yu. Solving Geometric Problems in Space-Conscious Models.

Degree: 2009, University of Waterloo

 When dealing with massive data sets, standard algorithms may easily ``run out of memory''. In this thesis, we design efficient algorithms in space-conscious models. In… (more)

Subjects/Keywords: Algorithms; Data Structures; Computational Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2009). Solving Geometric Problems in Space-Conscious Models. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4257

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

Chicago Manual of Style (16th Edition):

Chen, Yu. “Solving Geometric Problems in Space-Conscious Models.” 2009. Thesis, University of Waterloo. Accessed January 20, 2020. http://hdl.handle.net/10012/4257.

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

MLA Handbook (7th Edition):

Chen, Yu. “Solving Geometric Problems in Space-Conscious Models.” 2009. Web. 20 Jan 2020.

Vancouver:

Chen Y. Solving Geometric Problems in Space-Conscious Models. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10012/4257.

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

Council of Science Editors:

Chen Y. Solving Geometric Problems in Space-Conscious Models. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4257

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

17. Claude, Francisco. Space-Efficient Data Structures for Information Retrieval.

Degree: 2013, University of Waterloo

 The amount of data that people and companies store has grown exponentially over the last few years. Storing this information alone is not enough, because… (more)

Subjects/Keywords: data structures; algorithms

…Succinct Data Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1.1… …data in order to be feasible in practice. In this work we focus mostly on structures that… …Basic Succinct Data Structures In this section we present the basic ideas of succinct data… …building blocks for general data structures are permutations. Given a permutation over [n… …succinct data structures that appear recurrently as building blocks for more complex solutions… 

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

Claude, F. (2013). Space-Efficient Data Structures for Information Retrieval. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7491

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

Claude, Francisco. “Space-Efficient Data Structures for Information Retrieval.” 2013. Thesis, University of Waterloo. Accessed January 20, 2020. http://hdl.handle.net/10012/7491.

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

MLA Handbook (7th Edition):

Claude, Francisco. “Space-Efficient Data Structures for Information Retrieval.” 2013. Web. 20 Jan 2020.

Vancouver:

Claude F. Space-Efficient Data Structures for Information Retrieval. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10012/7491.

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

Council of Science Editors:

Claude F. Space-Efficient Data Structures for Information Retrieval. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7491

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


University of Texas – Austin

18. Kennedy, Christopher Garrett. Fast high dimensional approximation via random embeddings.

Degree: PhD, Mathematics, 2018, University of Texas – Austin

 In the big data era, dimension reduction techniques have been a key tool in making high dimensional geometric problems tractable. This thesis focuses on two… (more)

Subjects/Keywords: Data structures and algorithms; Computational geometry; Statistics theory; Information theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kennedy, C. G. (2018). Fast high dimensional approximation via random embeddings. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/72842

Chicago Manual of Style (16th Edition):

Kennedy, Christopher Garrett. “Fast high dimensional approximation via random embeddings.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed January 20, 2020. http://hdl.handle.net/2152/72842.

MLA Handbook (7th Edition):

Kennedy, Christopher Garrett. “Fast high dimensional approximation via random embeddings.” 2018. Web. 20 Jan 2020.

Vancouver:

Kennedy CG. Fast high dimensional approximation via random embeddings. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/2152/72842.

Council of Science Editors:

Kennedy CG. Fast high dimensional approximation via random embeddings. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/72842


University of Minnesota

19. Saladi, Rahul. Algorithms and Data Structures for Geometric Intersection Query Problems.

Degree: PhD, Computer Science, 2017, University of Minnesota

 The focus of this thesis is the topic of geometric intersection queries (GIQ) which has been very well studied by the computational geometry community and… (more)

Subjects/Keywords: aggregation; data structures; geometric algorithms; query time; range searching; size of the data structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saladi, R. (2017). Algorithms and Data Structures for Geometric Intersection Query Problems. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/191453

Chicago Manual of Style (16th Edition):

Saladi, Rahul. “Algorithms and Data Structures for Geometric Intersection Query Problems.” 2017. Doctoral Dissertation, University of Minnesota. Accessed January 20, 2020. http://hdl.handle.net/11299/191453.

MLA Handbook (7th Edition):

Saladi, Rahul. “Algorithms and Data Structures for Geometric Intersection Query Problems.” 2017. Web. 20 Jan 2020.

Vancouver:

Saladi R. Algorithms and Data Structures for Geometric Intersection Query Problems. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/11299/191453.

Council of Science Editors:

Saladi R. Algorithms and Data Structures for Geometric Intersection Query Problems. [Doctoral Dissertation]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/191453

20. Antoniou, Dimitrios. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.

Degree: 2011, University of Patras; Πανεπιστήμιο Πατρών

 In this dissertation we take an in-depth look at the use of effective and efficient data structures and algorithms in the fields of data mining… (more)

Subjects/Keywords: Αλγόριθμοι; Δομές δεδομένων; Ανάκτηση πληροφορίας; Τεχνολογίες διαδικτύου; Algorithms; Data structures; Data mining; Web technologies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Antoniou, D. (2011). Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. (Thesis). University of Patras; Πανεπιστήμιο Πατρών. Retrieved from http://hdl.handle.net/10442/hedi/33573

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

Antoniou, Dimitrios. “Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.” 2011. Thesis, University of Patras; Πανεπιστήμιο Πατρών. Accessed January 20, 2020. http://hdl.handle.net/10442/hedi/33573.

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

MLA Handbook (7th Edition):

Antoniou, Dimitrios. “Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.” 2011. Web. 20 Jan 2020.

Vancouver:

Antoniou D. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Internet] [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2011. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10442/hedi/33573.

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

Council of Science Editors:

Antoniou D. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2011. Available from: http://hdl.handle.net/10442/hedi/33573

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

21. Αντωνίου, Δημήτρης. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.

Degree: 2011, University of Patras

 Αντικείμενο της παρούσας διδακτορικής διατριβής είναι η μελέτη και τροποποίηση βασικών δομών δεδομένων με σκοπό τη δημιουργία νέων και την τροποποίηση υπαρχουσών λύσεων, με εφαρμογές… (more)

Subjects/Keywords: Αλγόριθμοι; Δομές δεδομένων; Ανάκτηση πληροφορίας; Τεχνολογίες διαδικτύου; 005.73; Algorithms; Data structures; Data mining; Web technologies

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Αντωνίου, . (2011). Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. (Doctoral Dissertation). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/4347

Chicago Manual of Style (16th Edition):

Αντωνίου, Δημήτρης. “Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.” 2011. Doctoral Dissertation, University of Patras. Accessed January 20, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/4347.

MLA Handbook (7th Edition):

Αντωνίου, Δημήτρης. “Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου.” 2011. Web. 20 Jan 2020.

Vancouver:

Αντωνίου . Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Internet] [Doctoral dissertation]. University of Patras; 2011. [cited 2020 Jan 20]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/4347.

Council of Science Editors:

Αντωνίου . Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Doctoral Dissertation]. University of Patras; 2011. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/4347


University of Hong Kong

22. 黎少斌; Lai, Shiao-bun. Trading off time for space for the string matching problem.

Degree: M. Phil., 1996, University of Hong Kong

published_or_final_version

Computer Science

Master

Master of Philosophy

Subjects/Keywords: Computer algorithms.; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

黎少斌; Lai, S. (1996). Trading off time for space for the string matching problem. (Masters Thesis). University of Hong Kong. Retrieved from Lai, S. [黎少斌]. (1996). Trading off time for space for the string matching problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3121421 ; http://dx.doi.org/10.5353/th_b3121421 ; http://hdl.handle.net/10722/39436

Chicago Manual of Style (16th Edition):

黎少斌; Lai, Shiao-bun. “Trading off time for space for the string matching problem.” 1996. Masters Thesis, University of Hong Kong. Accessed January 20, 2020. Lai, S. [黎少斌]. (1996). Trading off time for space for the string matching problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3121421 ; http://dx.doi.org/10.5353/th_b3121421 ; http://hdl.handle.net/10722/39436.

MLA Handbook (7th Edition):

黎少斌; Lai, Shiao-bun. “Trading off time for space for the string matching problem.” 1996. Web. 20 Jan 2020.

Vancouver:

黎少斌; Lai S. Trading off time for space for the string matching problem. [Internet] [Masters thesis]. University of Hong Kong; 1996. [cited 2020 Jan 20]. Available from: Lai, S. [黎少斌]. (1996). Trading off time for space for the string matching problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3121421 ; http://dx.doi.org/10.5353/th_b3121421 ; http://hdl.handle.net/10722/39436.

Council of Science Editors:

黎少斌; Lai S. Trading off time for space for the string matching problem. [Masters Thesis]. University of Hong Kong; 1996. Available from: Lai, S. [黎少斌]. (1996). Trading off time for space for the string matching problem. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3121421 ; http://dx.doi.org/10.5353/th_b3121421 ; http://hdl.handle.net/10722/39436


University of Hong Kong

23. 宋永健; Sung, Wing-kin. Fast labeled tree comparison via better matching algorithms.

Degree: PhD, 1998, University of Hong Kong

published_or_final_version

Computer Science

Doctoral

Doctor of Philosophy

Subjects/Keywords: Data structures (Computer science); Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

宋永健; Sung, W. (1998). Fast labeled tree comparison via better matching algorithms. (Doctoral Dissertation). University of Hong Kong. Retrieved from Sung, W. [宋永健]. (1998). Fast labeled tree comparison via better matching algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123931 ; http://dx.doi.org/10.5353/th_b3123931 ; http://hdl.handle.net/10722/35389

Chicago Manual of Style (16th Edition):

宋永健; Sung, Wing-kin. “Fast labeled tree comparison via better matching algorithms.” 1998. Doctoral Dissertation, University of Hong Kong. Accessed January 20, 2020. Sung, W. [宋永健]. (1998). Fast labeled tree comparison via better matching algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123931 ; http://dx.doi.org/10.5353/th_b3123931 ; http://hdl.handle.net/10722/35389.

MLA Handbook (7th Edition):

宋永健; Sung, Wing-kin. “Fast labeled tree comparison via better matching algorithms.” 1998. Web. 20 Jan 2020.

Vancouver:

宋永健; Sung W. Fast labeled tree comparison via better matching algorithms. [Internet] [Doctoral dissertation]. University of Hong Kong; 1998. [cited 2020 Jan 20]. Available from: Sung, W. [宋永健]. (1998). Fast labeled tree comparison via better matching algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123931 ; http://dx.doi.org/10.5353/th_b3123931 ; http://hdl.handle.net/10722/35389.

Council of Science Editors:

宋永健; Sung W. Fast labeled tree comparison via better matching algorithms. [Doctoral Dissertation]. University of Hong Kong; 1998. Available from: Sung, W. [宋永健]. (1998). Fast labeled tree comparison via better matching algorithms. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123931 ; http://dx.doi.org/10.5353/th_b3123931 ; http://hdl.handle.net/10722/35389


University of Notre Dame

24. Haitao Wang. Algorithms and Data Structures for Geometric Object Approximation Problems</h1>.

Degree: PhD, Computer Science and Engineering, 2010, University of Notre Dame

  The topic of geometric object approximation focuses on computing structurally or geometrically simpler objects to approximate an input complex object. This is a fundamental… (more)

Subjects/Keywords: Algorithms and data structures; Obnoxious line; Outliers; Points and curve approximation; Computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2010). Algorithms and Data Structures for Geometric Object Approximation Problems</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/jw827942g84

Chicago Manual of Style (16th Edition):

Wang, Haitao. “Algorithms and Data Structures for Geometric Object Approximation Problems</h1>.” 2010. Doctoral Dissertation, University of Notre Dame. Accessed January 20, 2020. https://curate.nd.edu/show/jw827942g84.

MLA Handbook (7th Edition):

Wang, Haitao. “Algorithms and Data Structures for Geometric Object Approximation Problems</h1>.” 2010. Web. 20 Jan 2020.

Vancouver:

Wang H. Algorithms and Data Structures for Geometric Object Approximation Problems</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2010. [cited 2020 Jan 20]. Available from: https://curate.nd.edu/show/jw827942g84.

Council of Science Editors:

Wang H. Algorithms and Data Structures for Geometric Object Approximation Problems</h1>. [Doctoral Dissertation]. University of Notre Dame; 2010. Available from: https://curate.nd.edu/show/jw827942g84


RMIT University

25. Hoobin, C. Efficient compression of large repetitive strings.

Degree: 2015, RMIT University

 When is comes to managing large volumes of data, general-purpose compressors such as gzip are ubiquitous. They are fast, practical and available on every modern… (more)

Subjects/Keywords: Fields of Research; text compression; text indexing; dictionary compression; data structures; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hoobin, C. (2015). Efficient compression of large repetitive strings. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:161449

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

Hoobin, C. “Efficient compression of large repetitive strings.” 2015. Thesis, RMIT University. Accessed January 20, 2020. http://researchbank.rmit.edu.au/view/rmit:161449.

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

MLA Handbook (7th Edition):

Hoobin, C. “Efficient compression of large repetitive strings.” 2015. Web. 20 Jan 2020.

Vancouver:

Hoobin C. Efficient compression of large repetitive strings. [Internet] [Thesis]. RMIT University; 2015. [cited 2020 Jan 20]. Available from: http://researchbank.rmit.edu.au/view/rmit:161449.

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

Council of Science Editors:

Hoobin C. Efficient compression of large repetitive strings. [Thesis]. RMIT University; 2015. Available from: http://researchbank.rmit.edu.au/view/rmit:161449

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


Ohio University

26. Tsanakas, Panagiotis D. Algorithms and data structures for hierarchical image processing.

Degree: MS, Electrical Engineering & Computer Science (Engineering and Technology), 1985, Ohio University

  This Thesis discusses methods for solving problems associated with hierarchical image processing systems. In particular, the problems dealt here are the hierarchical image data(more)

Subjects/Keywords: Algorithms; Data Structures; Hierarchical Image Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsanakas, P. D. (1985). Algorithms and data structures for hierarchical image processing. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184075678

Chicago Manual of Style (16th Edition):

Tsanakas, Panagiotis D. “Algorithms and data structures for hierarchical image processing.” 1985. Masters Thesis, Ohio University. Accessed January 20, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184075678.

MLA Handbook (7th Edition):

Tsanakas, Panagiotis D. “Algorithms and data structures for hierarchical image processing.” 1985. Web. 20 Jan 2020.

Vancouver:

Tsanakas PD. Algorithms and data structures for hierarchical image processing. [Internet] [Masters thesis]. Ohio University; 1985. [cited 2020 Jan 20]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184075678.

Council of Science Editors:

Tsanakas PD. Algorithms and data structures for hierarchical image processing. [Masters Thesis]. Ohio University; 1985. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1184075678


University of California – Riverside

27. Williams, Parker. Information Gathering on Bounded Degree Trees and Properties of Random Matrices.

Degree: Mathematics, 2017, University of California – Riverside

 In this thesis two questions are addressed. First is the question of the time complexity of an algorithm gathering information on a tree with unknown… (more)

Subjects/Keywords: Mathematics; Applied mathematics; Data Structures; Graph Algorithms; Graph Spectrum; Integral Eigenvalue; Random Matrix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Williams, P. (2017). Information Gathering on Bounded Degree Trees and Properties of Random Matrices. (Thesis). University of California – Riverside. Retrieved from http://www.escholarship.org/uc/item/40s7r2b1

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

Williams, Parker. “Information Gathering on Bounded Degree Trees and Properties of Random Matrices.” 2017. Thesis, University of California – Riverside. Accessed January 20, 2020. http://www.escholarship.org/uc/item/40s7r2b1.

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

MLA Handbook (7th Edition):

Williams, Parker. “Information Gathering on Bounded Degree Trees and Properties of Random Matrices.” 2017. Web. 20 Jan 2020.

Vancouver:

Williams P. Information Gathering on Bounded Degree Trees and Properties of Random Matrices. [Internet] [Thesis]. University of California – Riverside; 2017. [cited 2020 Jan 20]. Available from: http://www.escholarship.org/uc/item/40s7r2b1.

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

Council of Science Editors:

Williams P. Information Gathering on Bounded Degree Trees and Properties of Random Matrices. [Thesis]. University of California – Riverside; 2017. Available from: http://www.escholarship.org/uc/item/40s7r2b1

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

28. Lee, Patrick. On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures.

Degree: 2014, University of Waterloo

 Many standard problems in computational geometry have been solved asymptotically optimally as far as comparison-based algorithms are concerned, but there has been little work focusing… (more)

Subjects/Keywords: Algorithms; data structures; computational geometry

…location data structures. The new algorithms are summarised below: • We show how to compute the… …many classical problems in algorithms and data structures have long been known. The exact… …new data structures have a simple enough query algorithm so that the number of comparisons… …expected number of comparisons. Refer to Section 3.6. We give new data structures for point… …our new point location data structures. We conclude in Chapter 5 with some open problems. 4… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lee, P. (2014). On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8783

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

Lee, Patrick. “On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures.” 2014. Thesis, University of Waterloo. Accessed January 20, 2020. http://hdl.handle.net/10012/8783.

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

MLA Handbook (7th Edition):

Lee, Patrick. “On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures.” 2014. Web. 20 Jan 2020.

Vancouver:

Lee P. On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Jan 20]. Available from: http://hdl.handle.net/10012/8783.

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

Council of Science Editors:

Lee P. On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8783

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


University of Miami

29. Polpitiya, Lalintha G. A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning Under Uncertainty.

Degree: PhD, Electrical and Computer Engineering (Engineering), 2019, University of Miami

  The convenience, intuitiveness, and versatility of Dempster-Shafer (DS) theoretic models of data uncertainty make DS evidence theory an ideal framework for reasoning under uncertainty… (more)

Subjects/Keywords: Uncertainty in Artificial Intelligence; Dempster-Shafer Belief Theory; Data Structures; Algorithms; Computational Complexity; Visualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Polpitiya, L. G. (2019). A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning Under Uncertainty. (Doctoral Dissertation). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_dissertations/2378

Chicago Manual of Style (16th Edition):

Polpitiya, Lalintha G. “A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning Under Uncertainty.” 2019. Doctoral Dissertation, University of Miami. Accessed January 20, 2020. https://scholarlyrepository.miami.edu/oa_dissertations/2378.

MLA Handbook (7th Edition):

Polpitiya, Lalintha G. “A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning Under Uncertainty.” 2019. Web. 20 Jan 2020.

Vancouver:

Polpitiya LG. A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning Under Uncertainty. [Internet] [Doctoral dissertation]. University of Miami; 2019. [cited 2020 Jan 20]. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2378.

Council of Science Editors:

Polpitiya LG. A Framework for Efficient Implementation and Effective Visualization of Dempster-Shafer Belief Theoretic Computations for Reasoning Under Uncertainty. [Doctoral Dissertation]. University of Miami; 2019. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/2378


Princeton University

30. Larkin, Daniel. Compressing Trees with a Sledgehammer .

Degree: PhD, 2016, Princeton University

 A variety of problems can be solved more efficiently with the use of compressed trees. The compressed tree method is flexible and can be applied… (more)

Subjects/Keywords: algorithms; compressed trees; data structures; disjoint set union; nested set union; union-find

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Larkin, D. (2016). Compressing Trees with a Sledgehammer . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp011g05ff012

Chicago Manual of Style (16th Edition):

Larkin, Daniel. “Compressing Trees with a Sledgehammer .” 2016. Doctoral Dissertation, Princeton University. Accessed January 20, 2020. http://arks.princeton.edu/ark:/88435/dsp011g05ff012.

MLA Handbook (7th Edition):

Larkin, Daniel. “Compressing Trees with a Sledgehammer .” 2016. Web. 20 Jan 2020.

Vancouver:

Larkin D. Compressing Trees with a Sledgehammer . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2020 Jan 20]. Available from: http://arks.princeton.edu/ark:/88435/dsp011g05ff012.

Council of Science Editors:

Larkin D. Compressing Trees with a Sledgehammer . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp011g05ff012

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

.