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:(Data structures). Showing records 1 – 30 of 452 total matches.

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

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ Search Limiters

1. Carpen-Amarie, Maria. Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers.

Degree: 2017, Université de Neuchâtel

 De nos jours les systèmes multi-cœurs sont omniprésents. La conception des applications demande de plus en plus un moyen de synchronisation plus léger, ainsi qu'une… (more)

Subjects/Keywords: data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carpen-Amarie, M. (2017). Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers. (Thesis). Université de Neuchâtel. Retrieved from http://doc.rero.ch/record/309503

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

Carpen-Amarie, Maria. “Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers.” 2017. Thesis, Université de Neuchâtel. Accessed January 19, 2020. http://doc.rero.ch/record/309503.

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

MLA Handbook (7th Edition):

Carpen-Amarie, Maria. “Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers.” 2017. Web. 19 Jan 2020.

Vancouver:

Carpen-Amarie M. Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers. [Internet] [Thesis]. Université de Neuchâtel; 2017. [cited 2020 Jan 19]. Available from: http://doc.rero.ch/record/309503.

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

Council of Science Editors:

Carpen-Amarie M. Efficient memory management with hardware transactional memory: a focus on Java garbage collectors and C++ smart pointers. [Thesis]. Université de Neuchâtel; 2017. Available from: http://doc.rero.ch/record/309503

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

2. Zhou, Gelin. In-Memory Storage for Labeled Tree-Structured Data.

Degree: 2017, University of Waterloo

 In this thesis, we design in-memory data structures for labeled and weights trees, so that various types of path queries or operations can be supported… (more)

Subjects/Keywords: Data Structures; Path Queries; Labeled Trees; Succinct Data Structures; Space-efficient Data Structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, G. (2017). In-Memory Storage for Labeled Tree-Structured Data. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11500

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

Zhou, Gelin. “In-Memory Storage for Labeled Tree-Structured Data.” 2017. Thesis, University of Waterloo. Accessed January 19, 2020. http://hdl.handle.net/10012/11500.

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

MLA Handbook (7th Edition):

Zhou, Gelin. “In-Memory Storage for Labeled Tree-Structured Data.” 2017. Web. 19 Jan 2020.

Vancouver:

Zhou G. In-Memory Storage for Labeled Tree-Structured Data. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/10012/11500.

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

Council of Science Editors:

Zhou G. In-Memory Storage for Labeled Tree-Structured Data. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11500

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


Reykjavík University

3. Sigríður Lína Viðarsdóttir 1988; Ingibjörg Jónsdóttir 1988; Ísak Hilmarsson 1988; Steinunn Gróa Sigurðardóttir 1987. Wilf-classification of mesh patterns of short length.

Degree: 2011, Reykjavík University

This B.Sc. project deals with mesh pattern avoidance in permutations. A mesh pattern is a pair P=(p,R), where p is a permutation of length k… (more)

Subjects/Keywords: Gagnaskipan; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

1987, S. L. V. 1. I. J. 1. . H. 1. S. G. S. (2011). Wilf-classification of mesh patterns of short length. (Thesis). Reykjavík University. Retrieved from http://hdl.handle.net/1946/9181

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

1987, Sigríður Lína Viðarsdóttir 1988; Ingibjörg Jónsdóttir 1988; Ísak Hilmarsson 1988; Steinunn Gróa Sigurðardóttir. “Wilf-classification of mesh patterns of short length.” 2011. Thesis, Reykjavík University. Accessed January 19, 2020. http://hdl.handle.net/1946/9181.

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

MLA Handbook (7th Edition):

1987, Sigríður Lína Viðarsdóttir 1988; Ingibjörg Jónsdóttir 1988; Ísak Hilmarsson 1988; Steinunn Gróa Sigurðardóttir. “Wilf-classification of mesh patterns of short length.” 2011. Web. 19 Jan 2020.

Vancouver:

1987 SLV1IJ1H1SGS. Wilf-classification of mesh patterns of short length. [Internet] [Thesis]. Reykjavík University; 2011. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/1946/9181.

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

Council of Science Editors:

1987 SLV1IJ1H1SGS. Wilf-classification of mesh patterns of short length. [Thesis]. Reykjavík University; 2011. Available from: http://hdl.handle.net/1946/9181

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


Rutgers University

4. Zhang, Yayan, 1986-. Data normalization and clustering for big and small data and an application to clinical trials.

Degree: PhD, Statistics and Biostatistics, 2015, Rutgers University

The purpose of this thesis is to propose new methodology for data normalization and cluster prediction in order to help us unravel the structure of… (more)

Subjects/Keywords: Data structures (Computer science); Statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Yayan, 1. (2015). Data normalization and clustering for big and small data and an application to clinical trials. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/47619/

Chicago Manual of Style (16th Edition):

Zhang, Yayan, 1986-. “Data normalization and clustering for big and small data and an application to clinical trials.” 2015. Doctoral Dissertation, Rutgers University. Accessed January 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/47619/.

MLA Handbook (7th Edition):

Zhang, Yayan, 1986-. “Data normalization and clustering for big and small data and an application to clinical trials.” 2015. Web. 19 Jan 2020.

Vancouver:

Zhang, Yayan 1. Data normalization and clustering for big and small data and an application to clinical trials. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Jan 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47619/.

Council of Science Editors:

Zhang, Yayan 1. Data normalization and clustering for big and small data and an application to clinical trials. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47619/


Virginia Tech

5. Bock, Matthew. A Framework for Hadoop Based Digital Libraries of Tweets.

Degree: MS, Computer Science, 2017, Virginia Tech

 The Digital Library Research Laboratory (DLRL) has collected over 1.5 billion tweets for the Integrated Digital Event Archiving and Library (IDEAL) and Global Event Trend… (more)

Subjects/Keywords: big data; digital libraries; data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bock, M. (2017). A Framework for Hadoop Based Digital Libraries of Tweets. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78351

Chicago Manual of Style (16th Edition):

Bock, Matthew. “A Framework for Hadoop Based Digital Libraries of Tweets.” 2017. Masters Thesis, Virginia Tech. Accessed January 19, 2020. http://hdl.handle.net/10919/78351.

MLA Handbook (7th Edition):

Bock, Matthew. “A Framework for Hadoop Based Digital Libraries of Tweets.” 2017. Web. 19 Jan 2020.

Vancouver:

Bock M. A Framework for Hadoop Based Digital Libraries of Tweets. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/10919/78351.

Council of Science Editors:

Bock M. A Framework for Hadoop Based Digital Libraries of Tweets. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/78351


University of Waterloo

6. 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 19, 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. 19 Jan 2020.

Vancouver:

Pratt S. Three Approaches to Building Time-Windowed Geometric Data Structures. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Jan 19]. 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 Exeter

7. Fieldsend, Jonathan E. Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training.

Degree: PhD, 2003, University of Exeter

Subjects/Keywords: 006; Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fieldsend, J. E. (2003). Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training. (Doctoral Dissertation). University of Exeter. Retrieved from http://hdl.handle.net/10871/11706

Chicago Manual of Style (16th Edition):

Fieldsend, Jonathan E. “Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training.” 2003. Doctoral Dissertation, University of Exeter. Accessed January 19, 2020. http://hdl.handle.net/10871/11706.

MLA Handbook (7th Edition):

Fieldsend, Jonathan E. “Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training.” 2003. Web. 19 Jan 2020.

Vancouver:

Fieldsend JE. Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training. [Internet] [Doctoral dissertation]. University of Exeter; 2003. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/10871/11706.

Council of Science Editors:

Fieldsend JE. Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training. [Doctoral Dissertation]. University of Exeter; 2003. Available from: http://hdl.handle.net/10871/11706


University of Rochester

8. Rovner, Paul D. Automatic Representation Selection for Associative Data Structures.

Degree: PhD, 2011, University of Rochester

 The selection of efficient storage representations for high-level data structures is a design problem that is ready for systematic analysis. This thesis is about automating… (more)

Subjects/Keywords: efficient storage; associative data structures; automating; SAIL

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rovner, P. D. (2011). Automatic Representation Selection for Associative Data Structures. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/13790

Chicago Manual of Style (16th Edition):

Rovner, Paul D. “Automatic Representation Selection for Associative Data Structures.” 2011. Doctoral Dissertation, University of Rochester. Accessed January 19, 2020. http://hdl.handle.net/1802/13790.

MLA Handbook (7th Edition):

Rovner, Paul D. “Automatic Representation Selection for Associative Data Structures.” 2011. Web. 19 Jan 2020.

Vancouver:

Rovner PD. Automatic Representation Selection for Associative Data Structures. [Internet] [Doctoral dissertation]. University of Rochester; 2011. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/1802/13790.

Council of Science Editors:

Rovner PD. Automatic Representation Selection for Associative Data Structures. [Doctoral Dissertation]. University of Rochester; 2011. Available from: http://hdl.handle.net/1802/13790


University of Notre Dame

9. Kyle Bruce Wheeler. Exploiting Locality with Qthreads for Portable Parallel Performance</h1>.

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

  Large scale hardware-supported multithreading, an attractive means of increasing computational power, benefits significantly from low per-thread costs. Hardware support for lightweight threads and synchronization… (more)

Subjects/Keywords: state; lightweight; data structures; adaptive; memory; topology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wheeler, K. B. (2009). Exploiting Locality with Qthreads for Portable Parallel Performance</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/st74cn7230q

Chicago Manual of Style (16th Edition):

Wheeler, Kyle Bruce. “Exploiting Locality with Qthreads for Portable Parallel Performance</h1>.” 2009. Doctoral Dissertation, University of Notre Dame. Accessed January 19, 2020. https://curate.nd.edu/show/st74cn7230q.

MLA Handbook (7th Edition):

Wheeler, Kyle Bruce. “Exploiting Locality with Qthreads for Portable Parallel Performance</h1>.” 2009. Web. 19 Jan 2020.

Vancouver:

Wheeler KB. Exploiting Locality with Qthreads for Portable Parallel Performance</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2009. [cited 2020 Jan 19]. Available from: https://curate.nd.edu/show/st74cn7230q.

Council of Science Editors:

Wheeler KB. Exploiting Locality with Qthreads for Portable Parallel Performance</h1>. [Doctoral Dissertation]. University of Notre Dame; 2009. Available from: https://curate.nd.edu/show/st74cn7230q


University of Cincinnati

10. Sun, Shuyan. A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data.

Degree: PhD, Education, Criminal Justice, and Human Services: Educational Studies, 2012, University of Cincinnati

  Multilevel nonnested data structures are common in many research areas. The traditional hierarchical linear modeling requires purely nested data structures and thus cannot be… (more)

Subjects/Keywords: Psychological Tests; Multilevel nonnested data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, S. (2012). A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150

Chicago Manual of Style (16th Edition):

Sun, Shuyan. “A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data.” 2012. Doctoral Dissertation, University of Cincinnati. Accessed January 19, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150.

MLA Handbook (7th Edition):

Sun, Shuyan. “A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data.” 2012. Web. 19 Jan 2020.

Vancouver:

Sun S. A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data. [Internet] [Doctoral dissertation]. University of Cincinnati; 2012. [cited 2020 Jan 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150.

Council of Science Editors:

Sun S. A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data. [Doctoral Dissertation]. University of Cincinnati; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1337718150


Louisiana State University

11. Valliyil Thankachan, Sharma. Space-efficient data structures for string searching and retrieval.

Degree: PhD, Computer Sciences, 2013, Louisiana State University

 Let D = {d_1, d_2, ...} be a collection of string documents of n characters in total, which are drawn from an alphabet set Sigma… (more)

Subjects/Keywords: Data Structures; String Searching; Retrieval; Top-k

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Valliyil Thankachan, S. (2013). Space-efficient data structures for string searching and retrieval. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848

Chicago Manual of Style (16th Edition):

Valliyil Thankachan, Sharma. “Space-efficient data structures for string searching and retrieval.” 2013. Doctoral Dissertation, Louisiana State University. Accessed January 19, 2020. etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848.

MLA Handbook (7th Edition):

Valliyil Thankachan, Sharma. “Space-efficient data structures for string searching and retrieval.” 2013. Web. 19 Jan 2020.

Vancouver:

Valliyil Thankachan S. Space-efficient data structures for string searching and retrieval. [Internet] [Doctoral dissertation]. Louisiana State University; 2013. [cited 2020 Jan 19]. Available from: etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848.

Council of Science Editors:

Valliyil Thankachan S. Space-efficient data structures for string searching and retrieval. [Doctoral Dissertation]. Louisiana State University; 2013. Available from: etd-01162014-201105 ; https://digitalcommons.lsu.edu/gradschool_dissertations/2848


Mississippi State University

12. Mohanty, Somya Darsan. Ordered Merkle Tree - a versatile data-structure for security kernels.

Degree: PhD, Computer Science and Engineering, 2013, Mississippi State University

  Hidden undesired functionality is an unavoidable reality in any complex hardware or software component. Undesired functionality deliberately introduced Trojan horses or accidentally introduced bugsin… (more)

Subjects/Keywords: Authenticated Data-Structures; Trustworthy Computing; Security Kernels

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mohanty, S. D. (2013). Ordered Merkle Tree - a versatile data-structure for security kernels. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;

Chicago Manual of Style (16th Edition):

Mohanty, Somya Darsan. “Ordered Merkle Tree - a versatile data-structure for security kernels.” 2013. Doctoral Dissertation, Mississippi State University. Accessed January 19, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;.

MLA Handbook (7th Edition):

Mohanty, Somya Darsan. “Ordered Merkle Tree - a versatile data-structure for security kernels.” 2013. Web. 19 Jan 2020.

Vancouver:

Mohanty SD. Ordered Merkle Tree - a versatile data-structure for security kernels. [Internet] [Doctoral dissertation]. Mississippi State University; 2013. [cited 2020 Jan 19]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;.

Council of Science Editors:

Mohanty SD. Ordered Merkle Tree - a versatile data-structure for security kernels. [Doctoral Dissertation]. Mississippi State University; 2013. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06242013-124105/ ;


Northeastern University

13. Catalano, Dominic J. The Nearly Optimal N-ary Search Tree.

Degree: MS, Department of Electrical and Computer Engineering, 2016, Northeastern University

 As the scale and importance of data increases, so does the task of information retrieval. Currently, the best methodology for index based structures offers a… (more)

Subjects/Keywords: data structures; optimized search; search trees

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Catalano, D. J. (2016). The Nearly Optimal N-ary Search Tree. (Masters Thesis). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20253673

Chicago Manual of Style (16th Edition):

Catalano, Dominic J. “The Nearly Optimal N-ary Search Tree.” 2016. Masters Thesis, Northeastern University. Accessed January 19, 2020. http://hdl.handle.net/2047/D20253673.

MLA Handbook (7th Edition):

Catalano, Dominic J. “The Nearly Optimal N-ary Search Tree.” 2016. Web. 19 Jan 2020.

Vancouver:

Catalano DJ. The Nearly Optimal N-ary Search Tree. [Internet] [Masters thesis]. Northeastern University; 2016. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/2047/D20253673.

Council of Science Editors:

Catalano DJ. The Nearly Optimal N-ary Search Tree. [Masters Thesis]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20253673

14. 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 19, 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. 19 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 19]. 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


University of Ontario Institute of Technology

15. Bourennani, Farid. Integration of heterogeneous data types using self organizing maps.

Degree: 2009, University of Ontario Institute of Technology

 With the growth of computer networks and the advancement of hardware technologies, unprecedented access to data volumes become accessible in a distributed fashion forming heterogeneous… (more)

Subjects/Keywords: Data integration; Information structures; Self-organizing maps; Data cleaning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bourennani, F. (2009). Integration of heterogeneous data types using self organizing maps. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/41

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

Bourennani, Farid. “Integration of heterogeneous data types using self organizing maps.” 2009. Thesis, University of Ontario Institute of Technology. Accessed January 19, 2020. http://hdl.handle.net/10155/41.

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

MLA Handbook (7th Edition):

Bourennani, Farid. “Integration of heterogeneous data types using self organizing maps.” 2009. Web. 19 Jan 2020.

Vancouver:

Bourennani F. Integration of heterogeneous data types using self organizing maps. [Internet] [Thesis]. University of Ontario Institute of Technology; 2009. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/10155/41.

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

Council of Science Editors:

Bourennani F. Integration of heterogeneous data types using self organizing maps. [Thesis]. University of Ontario Institute of Technology; 2009. Available from: http://hdl.handle.net/10155/41

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


Portland State University

16. Archer, David William. Conceptual Modeling of Data with Provenance.

Degree: PhD, Computer Science, 2011, Portland State University

  Traditional database systems manage data, but often do not address its provenance. In the past, users were often implicitly familiar with data they used,… (more)

Subjects/Keywords: Database management; Electronic data processing; Data structures (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Archer, D. W. (2011). Conceptual Modeling of Data with Provenance. (Doctoral Dissertation). Portland State University. Retrieved from https://pdxscholar.library.pdx.edu/open_access_etds/133

Chicago Manual of Style (16th Edition):

Archer, David William. “Conceptual Modeling of Data with Provenance.” 2011. Doctoral Dissertation, Portland State University. Accessed January 19, 2020. https://pdxscholar.library.pdx.edu/open_access_etds/133.

MLA Handbook (7th Edition):

Archer, David William. “Conceptual Modeling of Data with Provenance.” 2011. Web. 19 Jan 2020.

Vancouver:

Archer DW. Conceptual Modeling of Data with Provenance. [Internet] [Doctoral dissertation]. Portland State University; 2011. [cited 2020 Jan 19]. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/133.

Council of Science Editors:

Archer DW. Conceptual Modeling of Data with Provenance. [Doctoral Dissertation]. Portland State University; 2011. Available from: https://pdxscholar.library.pdx.edu/open_access_etds/133


Columbia University

17. Lu, Feihan. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.

Degree: 2018, Columbia University

 Bayesian statistical procedures use probabilistic models and probability distributions to summarize data, estimate unknown quantities of interest, and predict future observations. The procedures borrow strength… (more)

Subjects/Keywords: Statistics; Bayesian statistical decision theory; Data structures (Computer science); Neurosciences – Data processing; Medicine – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, F. (2018). Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8VD8FXF

Chicago Manual of Style (16th Edition):

Lu, Feihan. “Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.” 2018. Doctoral Dissertation, Columbia University. Accessed January 19, 2020. https://doi.org/10.7916/D8VD8FXF.

MLA Handbook (7th Edition):

Lu, Feihan. “Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.” 2018. Web. 19 Jan 2020.

Vancouver:

Lu F. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2020 Jan 19]. Available from: https://doi.org/10.7916/D8VD8FXF.

Council of Science Editors:

Lu F. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8VD8FXF

18. 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 19, 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. 19 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 19]. 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


Brno University of Technology

19. Janeček, Jan. Řídicí a datové struktury v programovacích jazycích .

Degree: 2010, Brno University of Technology

 Podstatou této práce je uvést základní informace o algoritmizaci a obecné poznatky o řídicích a datových strukturách. Tyto poznatky jsou pak ve vybraných programovacích jazycích… (more)

Subjects/Keywords: Řídicí struktury; datové struktury; programování; programovací jazyk; Control structures; data structures; programming; programming language

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Janeček, J. (2010). Řídicí a datové struktury v programovacích jazycích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/18887

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

Janeček, Jan. “Řídicí a datové struktury v programovacích jazycích .” 2010. Thesis, Brno University of Technology. Accessed January 19, 2020. http://hdl.handle.net/11012/18887.

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

MLA Handbook (7th Edition):

Janeček, Jan. “Řídicí a datové struktury v programovacích jazycích .” 2010. Web. 19 Jan 2020.

Vancouver:

Janeček J. Řídicí a datové struktury v programovacích jazycích . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/11012/18887.

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

Council of Science Editors:

Janeček J. Řídicí a datové struktury v programovacích jazycích . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/18887

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

20. Kanellou, Eleni. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.

Degree: Docteur es, Informatique, 2015, Rennes 1

Actuellement, la majorité des architectures de processeurs sont fondées sur une mémoire partagée avec cohérence de caches. Des prototypes intégrant de grandes quantités de cœurs,… (more)

Subjects/Keywords: Mémoire transactionnelle logicielle; Programmation concurrente; Structures de données; Structures de données (informatique); Stm; Concurrent programming; Data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kanellou, E. (2015). Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. (Doctoral Dissertation). Rennes 1. Retrieved from http://www.theses.fr/2015REN1S171

Chicago Manual of Style (16th Edition):

Kanellou, Eleni. “Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.” 2015. Doctoral Dissertation, Rennes 1. Accessed January 19, 2020. http://www.theses.fr/2015REN1S171.

MLA Handbook (7th Edition):

Kanellou, Eleni. “Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur.” 2015. Web. 19 Jan 2020.

Vancouver:

Kanellou E. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. [Internet] [Doctoral dissertation]. Rennes 1; 2015. [cited 2020 Jan 19]. Available from: http://www.theses.fr/2015REN1S171.

Council of Science Editors:

Kanellou E. Data structures for current multi-core and future many-core architectures : Structures de données pour des architectures multi-cœur actuelles et de futures architectures many-cœur. [Doctoral Dissertation]. Rennes 1; 2015. Available from: http://www.theses.fr/2015REN1S171


Brno University of Technology

21. Zahradníček, Tomáš. Knihovna pro vizualizaci dynamických datových struktur .

Degree: 2017, Brno University of Technology

 Tato práce se zabývá návrhem a implementací knihovny pro vizualizaci dynamických datových struktur ve formě orientovaných grafů. Zaměřuje se také na chyby, které při implementaci… (more)

Subjects/Keywords: Vizualizace datových struktur; ladicí nástroj; dynamické datové struktury; Visualization of data structures; debugger; dynamic data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zahradníček, T. (2017). Knihovna pro vizualizaci dynamických datových struktur . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/69742

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

Zahradníček, Tomáš. “Knihovna pro vizualizaci dynamických datových struktur .” 2017. Thesis, Brno University of Technology. Accessed January 19, 2020. http://hdl.handle.net/11012/69742.

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

MLA Handbook (7th Edition):

Zahradníček, Tomáš. “Knihovna pro vizualizaci dynamických datových struktur .” 2017. Web. 19 Jan 2020.

Vancouver:

Zahradníček T. Knihovna pro vizualizaci dynamických datových struktur . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/11012/69742.

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

Council of Science Editors:

Zahradníček T. Knihovna pro vizualizaci dynamických datových struktur . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/69742

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


RMIT University

22. Razavi Hesabi, Z. Mining complex data in highly streaming environments.

Degree: 2019, RMIT University

Data is growing at a rapid rate because of advanced hardware and software technologies and platforms such as e-health systems, sensor networks, and social media.… (more)

Subjects/Keywords: Fields of Research; data summarization; big data; machine learning; distributed computing; data management; dimensionality reduction; compression; clustering; histograms; index data structures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Razavi Hesabi, Z. (2019). Mining complex data in highly streaming environments. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162912

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

Razavi Hesabi, Z. “Mining complex data in highly streaming environments.” 2019. Thesis, RMIT University. Accessed January 19, 2020. http://researchbank.rmit.edu.au/view/rmit:162912.

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

MLA Handbook (7th Edition):

Razavi Hesabi, Z. “Mining complex data in highly streaming environments.” 2019. Web. 19 Jan 2020.

Vancouver:

Razavi Hesabi Z. Mining complex data in highly streaming environments. [Internet] [Thesis]. RMIT University; 2019. [cited 2020 Jan 19]. Available from: http://researchbank.rmit.edu.au/view/rmit:162912.

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

Council of Science Editors:

Razavi Hesabi Z. Mining complex data in highly streaming environments. [Thesis]. RMIT University; 2019. Available from: http://researchbank.rmit.edu.au/view/rmit:162912

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


University of Hong Kong

23. Zhang, Xin, Iris. Fast mining of spatial co-location patterns.

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

toc

abstract

published_or_final_version

Computer Science and Information Systems

Master

Master of Philosophy

Advisors/Committee Members: Cheung, DWL.

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Xin, I. (2004). Fast mining of spatial co-location patterns. (Masters Thesis). University of Hong Kong. Retrieved from Zhang, X. I. [張欣]. (2004). Fast mining of spatial co-location patterns. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3046270 ; http://dx.doi.org/10.5353/th_b3046270 ; http://hdl.handle.net/10722/32222

Chicago Manual of Style (16th Edition):

Zhang, Xin, Iris. “Fast mining of spatial co-location patterns.” 2004. Masters Thesis, University of Hong Kong. Accessed January 19, 2020. Zhang, X. I. [張欣]. (2004). Fast mining of spatial co-location patterns. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3046270 ; http://dx.doi.org/10.5353/th_b3046270 ; http://hdl.handle.net/10722/32222.

MLA Handbook (7th Edition):

Zhang, Xin, Iris. “Fast mining of spatial co-location patterns.” 2004. Web. 19 Jan 2020.

Vancouver:

Zhang, Xin I. Fast mining of spatial co-location patterns. [Internet] [Masters thesis]. University of Hong Kong; 2004. [cited 2020 Jan 19]. Available from: Zhang, X. I. [張欣]. (2004). Fast mining of spatial co-location patterns. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3046270 ; http://dx.doi.org/10.5353/th_b3046270 ; http://hdl.handle.net/10722/32222.

Council of Science Editors:

Zhang, Xin I. Fast mining of spatial co-location patterns. [Masters Thesis]. University of Hong Kong; 2004. Available from: Zhang, X. I. [張欣]. (2004). Fast mining of spatial co-location patterns. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3046270 ; http://dx.doi.org/10.5353/th_b3046270 ; http://hdl.handle.net/10722/32222


University of Minnesota

24. 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 19, 2020. http://hdl.handle.net/11299/191453.

MLA Handbook (7th Edition):

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

Vancouver:

Saladi R. Algorithms and Data Structures for Geometric Intersection Query Problems. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2020 Jan 19]. 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


University of Florida

25. Zhou, You. Highly Efficient Data Structures and Probabilistic Measurement Methods on Big Network Data.

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

 There is hardly any other data set whose size can rival the big network data that flows on the Internet. Massive and distributed data are… (more)

Subjects/Keywords: big-network-data  – compact-data-structures  – probabilistic-measurement-methods  – security  – traffic-measurement

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, Y. (2017). Highly Efficient Data Structures and Probabilistic Measurement Methods on Big Network Data. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0051710

Chicago Manual of Style (16th Edition):

Zhou, You. “Highly Efficient Data Structures and Probabilistic Measurement Methods on Big Network Data.” 2017. Doctoral Dissertation, University of Florida. Accessed January 19, 2020. http://ufdc.ufl.edu/UFE0051710.

MLA Handbook (7th Edition):

Zhou, You. “Highly Efficient Data Structures and Probabilistic Measurement Methods on Big Network Data.” 2017. Web. 19 Jan 2020.

Vancouver:

Zhou Y. Highly Efficient Data Structures and Probabilistic Measurement Methods on Big Network Data. [Internet] [Doctoral dissertation]. University of Florida; 2017. [cited 2020 Jan 19]. Available from: http://ufdc.ufl.edu/UFE0051710.

Council of Science Editors:

Zhou Y. Highly Efficient Data Structures and Probabilistic Measurement Methods on Big Network Data. [Doctoral Dissertation]. University of Florida; 2017. Available from: http://ufdc.ufl.edu/UFE0051710

26. 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 19, 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. 19 Jan 2020.

Vancouver:

Antoniou D. Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Internet] [Thesis]. University of Patras; Πανεπιστήμιο Πατρών; 2011. [cited 2020 Jan 19]. 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

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

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 19, 2020. http://nemertes.lis.upatras.gr/jspui/handle/10889/4347.

MLA Handbook (7th Edition):

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

Vancouver:

Αντωνίου . Αποτελεσματικοί αλγόριθμοι και δομές δεδομένων με εφαρμογές στην ανάκτηση πληροφορίας και στις τεχνολογίες διαδικτύου. [Internet] [Doctoral dissertation]. University of Patras; 2011. [cited 2020 Jan 19]. 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

28. Fragkoulis, Marios. Technologies for main memory data analysis.

Degree: 2017, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών

 The digital data has become a key resource for solving scienƟfic and business problems and achieving compeƟƟve advantage. With this purpose the scienƟfic and business… (more)

Subjects/Keywords: Ανάλυση δεδομένων; Δομές δεδομένων; Κύρια μνήμη; SQL; Data analysis; Data structures; Main memory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fragkoulis, M. (2017). Technologies for main memory data analysis. (Thesis). Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Retrieved from http://hdl.handle.net/10442/hedi/44021

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

Fragkoulis, Marios. “Technologies for main memory data analysis.” 2017. Thesis, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Accessed January 19, 2020. http://hdl.handle.net/10442/hedi/44021.

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

MLA Handbook (7th Edition):

Fragkoulis, Marios. “Technologies for main memory data analysis.” 2017. Web. 19 Jan 2020.

Vancouver:

Fragkoulis M. Technologies for main memory data analysis. [Internet] [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/10442/hedi/44021.

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

Council of Science Editors:

Fragkoulis M. Technologies for main memory data analysis. [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2017. Available from: http://hdl.handle.net/10442/hedi/44021

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


The Ohio State University

29. Normore, Lorraine Dombrowski. Strategies in searching hierarchical data structures .

Degree: PhD, Graduate School, 1986, The Ohio State University

Subjects/Keywords: Psychology; Data structures; Search theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Normore, L. D. (1986). Strategies in searching hierarchical data structures . (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147771

Chicago Manual of Style (16th Edition):

Normore, Lorraine Dombrowski. “Strategies in searching hierarchical data structures .” 1986. Doctoral Dissertation, The Ohio State University. Accessed January 19, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147771.

MLA Handbook (7th Edition):

Normore, Lorraine Dombrowski. “Strategies in searching hierarchical data structures .” 1986. Web. 19 Jan 2020.

Vancouver:

Normore LD. Strategies in searching hierarchical data structures . [Internet] [Doctoral dissertation]. The Ohio State University; 1986. [cited 2020 Jan 19]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147771.

Council of Science Editors:

Normore LD. Strategies in searching hierarchical data structures . [Doctoral Dissertation]. The Ohio State University; 1986. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147771


University of Plymouth

30. Rutz, Hanns Holger. Tracing the compositional process : sound art that rewrites its own past : formation, praxis and a computer framework.

Degree: PhD, 2014, University of Plymouth

 The domain of this thesis is electroacoustic computer-based music and sound art. It investigates a facet of composition which is often neglected or ill-defined: the… (more)

Subjects/Keywords: 781.3; computer music; sound art; data structures; electroacoustic music; composition process

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rutz, H. H. (2014). Tracing the compositional process : sound art that rewrites its own past : formation, praxis and a computer framework. (Doctoral Dissertation). University of Plymouth. Retrieved from http://hdl.handle.net/10026.1/3116

Chicago Manual of Style (16th Edition):

Rutz, Hanns Holger. “Tracing the compositional process : sound art that rewrites its own past : formation, praxis and a computer framework.” 2014. Doctoral Dissertation, University of Plymouth. Accessed January 19, 2020. http://hdl.handle.net/10026.1/3116.

MLA Handbook (7th Edition):

Rutz, Hanns Holger. “Tracing the compositional process : sound art that rewrites its own past : formation, praxis and a computer framework.” 2014. Web. 19 Jan 2020.

Vancouver:

Rutz HH. Tracing the compositional process : sound art that rewrites its own past : formation, praxis and a computer framework. [Internet] [Doctoral dissertation]. University of Plymouth; 2014. [cited 2020 Jan 19]. Available from: http://hdl.handle.net/10026.1/3116.

Council of Science Editors:

Rutz HH. Tracing the compositional process : sound art that rewrites its own past : formation, praxis and a computer framework. [Doctoral Dissertation]. University of Plymouth; 2014. Available from: http://hdl.handle.net/10026.1/3116

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

.