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 +publisher:"Texas A&M University" +contributor:("Chen, Jianer"). Showing records 1 – 30 of 66 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


Texas A&M University

1. Gu, Jiacheng. On Dependent Data Fetching in Cloud Environment.

Degree: 2015, Texas A&M University

 This work was motivated by the study of the file fetching process in a cloud system, in particular by the recent progress in the model… (more)

Subjects/Keywords: File Fetching; Cloud Environment; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gu, J. (2015). On Dependent Data Fetching in Cloud Environment. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156206

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

Gu, Jiacheng. “On Dependent Data Fetching in Cloud Environment.” 2015. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/156206.

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

MLA Handbook (7th Edition):

Gu, Jiacheng. “On Dependent Data Fetching in Cloud Environment.” 2015. Web. 20 Apr 2019.

Vancouver:

Gu J. On Dependent Data Fetching in Cloud Environment. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/156206.

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

Council of Science Editors:

Gu J. On Dependent Data Fetching in Cloud Environment. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/156206

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


Texas A&M University

2. Buchanan, Austin Loyd. Parameterized Approaches for Large-Scale Optimization Problems.

Degree: 2015, Texas A&M University

 In this dissertation, we study challenging discrete optimization problems from the perspective of parameterized complexity. The usefulness of this type of analysis is twofold. First,… (more)

Subjects/Keywords: parameterized complexity; integer programming; extended formulations; fixed-parameter tractable; combinatorial optimization; Steiner tree; node-weighted Steiner tree; maximum-weight connected subgraph; vertex cover; independent set; maximum clique; degeneracy; conflict graph; 0-1 program; treewidth; independence system; extension complexity; exponential time hypothesis; cardinality constraint; polyhedra; polytope; algorithm; connectivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buchanan, A. L. (2015). Parameterized Approaches for Large-Scale Optimization Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155568

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

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/155568.

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

MLA Handbook (7th Edition):

Buchanan, Austin Loyd. “Parameterized Approaches for Large-Scale Optimization Problems.” 2015. Web. 20 Apr 2019.

Vancouver:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/155568.

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

Council of Science Editors:

Buchanan AL. Parameterized Approaches for Large-Scale Optimization Problems. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155568

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


Texas A&M University

3. Wu, Lei. An efficient logic fault diagnosis framework based on effect-cause approach.

Degree: 2009, Texas A&M University

 Fault diagnosis plays an important role in improving the circuit design process and the manufacturing yield. With the increasing number of gates in modern circuits,… (more)

Subjects/Keywords: VLSI; diagnosis; effect-cause; critical path tracing; logic fault

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, L. (2009). An efficient logic fault diagnosis framework based on effect-cause approach. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2442

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

Wu, Lei. “An efficient logic fault diagnosis framework based on effect-cause approach.” 2009. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2442.

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

MLA Handbook (7th Edition):

Wu, Lei. “An efficient logic fault diagnosis framework based on effect-cause approach.” 2009. Web. 20 Apr 2019.

Vancouver:

Wu L. An efficient logic fault diagnosis framework based on effect-cause approach. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2442.

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

Council of Science Editors:

Wu L. An efficient logic fault diagnosis framework based on effect-cause approach. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2442

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


Texas A&M University

4. Wang, Meiqiu. Support graph preconditioning for elliptic finite element problems.

Degree: 2009, Texas A&M University

 A relatively new preconditioning technique called support graph preconditioning has many merits over the traditional incomplete factorization based methods. A major limitation of this technique… (more)

Subjects/Keywords: iterative methods; Conjugate gradient; Preconditioning; Support graphs; M-matrix

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, M. (2009). Support graph preconditioning for elliptic finite element problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-3135

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

Wang, Meiqiu. “Support graph preconditioning for elliptic finite element problems.” 2009. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-3135.

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

MLA Handbook (7th Edition):

Wang, Meiqiu. “Support graph preconditioning for elliptic finite element problems.” 2009. Web. 20 Apr 2019.

Vancouver:

Wang M. Support graph preconditioning for elliptic finite element problems. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-3135.

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

Council of Science Editors:

Wang M. Support graph preconditioning for elliptic finite element problems. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-3135

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


Texas A&M University

5. Subramanian, Sivaramakrishnan. Deterministic knowledge about nearby nodes in a mobile one dimensional environment.

Degree: 2009, Texas A&M University

 Mobile ad hoc networks consist of potentially moving, computing nodes that communicate via radio and do not have access to any fixed infrastructure. The knowl-… (more)

Subjects/Keywords: mobile ad hoc network; broadcast; leader election

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Subramanian, S. (2009). Deterministic knowledge about nearby nodes in a mobile one dimensional environment. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1077

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

Subramanian, Sivaramakrishnan. “Deterministic knowledge about nearby nodes in a mobile one dimensional environment.” 2009. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1077.

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

MLA Handbook (7th Edition):

Subramanian, Sivaramakrishnan. “Deterministic knowledge about nearby nodes in a mobile one dimensional environment.” 2009. Web. 20 Apr 2019.

Vancouver:

Subramanian S. Deterministic knowledge about nearby nodes in a mobile one dimensional environment. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1077.

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

Council of Science Editors:

Subramanian S. Deterministic knowledge about nearby nodes in a mobile one dimensional environment. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1077

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


Texas A&M University

6. Lu, Songjian. Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics.

Degree: 2010, Texas A&M University

 Parameterized NP-hard problems are NP-hard problems that are associated with special variables called parameters. One example of the problem is to find simple paths of… (more)

Subjects/Keywords: Algorithm; parameterized NP-hard problems; fixed parameter tractable; Directed feedback back vertex set problem; bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, S. (2010). Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222

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

Lu, Songjian. “Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics.” 2010. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222.

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

MLA Handbook (7th Edition):

Lu, Songjian. “Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics.” 2010. Web. 20 Apr 2019.

Vancouver:

Lu S. Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222.

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

Council of Science Editors:

Lu S. Randomized and Deterministic Parameterized Algorithms and Their Applications in Bioinformatics. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7222

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


Texas A&M University

7. Grigoriu, Liliana. Multiprocessor Scheduling with Availability Constraints.

Degree: 2010, Texas A&M University

 We consider the problem of scheduling a given set of tasks on multiple pro- cessors with predefined periods of unavailability, with the aim of minimizing… (more)

Subjects/Keywords: multiprocessor scheduling; LPT; machine shutdowns; worst-case bounds; makespan; fixed jobs; Multifit; uniform processors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Grigoriu, L. (2010). Multiprocessor Scheduling with Availability Constraints. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694

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

Grigoriu, Liliana. “Multiprocessor Scheduling with Availability Constraints.” 2010. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694.

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

MLA Handbook (7th Edition):

Grigoriu, Liliana. “Multiprocessor Scheduling with Availability Constraints.” 2010. Web. 20 Apr 2019.

Vancouver:

Grigoriu L. Multiprocessor Scheduling with Availability Constraints. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694.

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

Council of Science Editors:

Grigoriu L. Multiprocessor Scheduling with Availability Constraints. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694

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


Texas A&M University

8. Li, Hao. Storage Techniques in Flash Memories and Phase-change Memories.

Degree: 2010, Texas A&M University

 Non-volatile memories are an emerging storage technology with wide applica- tions in many important areas. This study focuses on new storage techniques for flash memories… (more)

Subjects/Keywords: storage techniques; flash memories; phase-change memories

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, H. (2010). Storage Techniques in Flash Memories and Phase-change Memories. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8307

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

Chicago Manual of Style (16th Edition):

Li, Hao. “Storage Techniques in Flash Memories and Phase-change Memories.” 2010. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8307.

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

MLA Handbook (7th Edition):

Li, Hao. “Storage Techniques in Flash Memories and Phase-change Memories.” 2010. Web. 20 Apr 2019.

Vancouver:

Li H. Storage Techniques in Flash Memories and Phase-change Memories. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8307.

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

Council of Science Editors:

Li H. Storage Techniques in Flash Memories and Phase-change Memories. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8307

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


Texas A&M University

9. Viqar, Saira. Communication Algorithms for Wireless Ad Hoc Networks.

Degree: 2012, Texas A&M University

 In this dissertation we present deterministic algorithms for reliable and efficient communication in ad hoc networks. In the first part of this dissertation we give… (more)

Subjects/Keywords: Mobile Ad Hoc Networks; Sensor Networks; Neighbor Discovery

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Viqar, S. (2012). Communication Algorithms for Wireless Ad Hoc Networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766

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

Viqar, Saira. “Communication Algorithms for Wireless Ad Hoc Networks.” 2012. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766.

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

MLA Handbook (7th Edition):

Viqar, Saira. “Communication Algorithms for Wireless Ad Hoc Networks.” 2012. Web. 20 Apr 2019.

Vancouver:

Viqar S. Communication Algorithms for Wireless Ad Hoc Networks. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766.

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

Council of Science Editors:

Viqar S. Communication Algorithms for Wireless Ad Hoc Networks. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11766

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


Texas A&M University

10. Li, Xiafeng. On Discrete Hyperbox Packing.

Degree: 2010, Texas A&M University

 Bin packing is a very important and popular research area in the computer science field. Past work showed many good and real-world packing algorithms. How-… (more)

Subjects/Keywords: bin packing; approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, X. (2010). On Discrete Hyperbox Packing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186

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

Chicago Manual of Style (16th Edition):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

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

MLA Handbook (7th Edition):

Li, Xiafeng. “On Discrete Hyperbox Packing.” 2010. Web. 20 Apr 2019.

Vancouver:

Li X. On Discrete Hyperbox Packing. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186.

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

Council of Science Editors:

Li X. On Discrete Hyperbox Packing. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-186

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


Texas A&M University

11. Lu, Hong. Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks.

Degree: 2010, Texas A&M University

 An ad hoc network is formed by a group of self-configuring nodes, typically deployed in two or three dimensional spaces, and communicating with each other… (more)

Subjects/Keywords: information retrieval; ad hoc network; distance sensitivity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, H. (2010). Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-187

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

Lu, Hong. “Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks.” 2010. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-187.

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

MLA Handbook (7th Edition):

Lu, Hong. “Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks.” 2010. Web. 20 Apr 2019.

Vancouver:

Lu H. Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-187.

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

Council of Science Editors:

Lu H. Optimization Algorithms for Information Retrieval and Transmission in Distributed Ad Hoc Networks. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-187

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


Texas A&M University

12. Tiwari, Praveen 1985-. On Covering Points with Conics and Strips in the Plane.

Degree: 2012, Texas A&M University

 Geometric covering problems have always been of focus in computer scientific research. The generic geometric covering problem asks to cover a set S of n… (more)

Subjects/Keywords: Approximation; Fixed-parameter tractability; NP-Hardness; Geometric Cover

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tiwari, P. 1. (2012). On Covering Points with Conics and Strips in the Plane. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/148314

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

Tiwari, Praveen 1985-. “On Covering Points with Conics and Strips in the Plane.” 2012. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/148314.

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

MLA Handbook (7th Edition):

Tiwari, Praveen 1985-. “On Covering Points with Conics and Strips in the Plane.” 2012. Web. 20 Apr 2019.

Vancouver:

Tiwari P1. On Covering Points with Conics and Strips in the Plane. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/148314.

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

Council of Science Editors:

Tiwari P1. On Covering Points with Conics and Strips in the Plane. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/148314

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


Texas A&M University

13. Hu, Shiyu. A Topological Theory of Weaving and Its Applications in Computer Graphics.

Degree: 2013, Texas A&M University

 Recent advances in the computer graphics of woven images on surfaces in 3-space motivate the development of weavings for arbitrary genus surfaces. We present herein… (more)

Subjects/Keywords: Weaving; Topology; Computer Graphics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, S. (2013). A Topological Theory of Weaving and Its Applications in Computer Graphics. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/150958

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

Hu, Shiyu. “A Topological Theory of Weaving and Its Applications in Computer Graphics.” 2013. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/150958.

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

MLA Handbook (7th Edition):

Hu, Shiyu. “A Topological Theory of Weaving and Its Applications in Computer Graphics.” 2013. Web. 20 Apr 2019.

Vancouver:

Hu S. A Topological Theory of Weaving and Its Applications in Computer Graphics. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/150958.

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

Council of Science Editors:

Hu S. A Topological Theory of Weaving and Its Applications in Computer Graphics. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/150958

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


Texas A&M University

14. Fan, Jia-Hao. Cuts and Partitions in Graphs/Trees with Applications.

Degree: 2013, Texas A&M University

 Both the maximum agreement forest problem and the multicut on trees problem are NP-hard, thus cannot be solved efficiently if P /=NP. The maximum agreement… (more)

Subjects/Keywords: parameterized algorithm; approximation algorithm; polynomial kernel; bioinformatics; maximum agreement forest; multicut on trees; protein complex prediction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fan, J. (2013). Cuts and Partitions in Graphs/Trees with Applications. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151050

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

Fan, Jia-Hao. “Cuts and Partitions in Graphs/Trees with Applications.” 2013. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/151050.

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

MLA Handbook (7th Edition):

Fan, Jia-Hao. “Cuts and Partitions in Graphs/Trees with Applications.” 2013. Web. 20 Apr 2019.

Vancouver:

Fan J. Cuts and Partitions in Graphs/Trees with Applications. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/151050.

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

Council of Science Editors:

Fan J. Cuts and Partitions in Graphs/Trees with Applications. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151050

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


Texas A&M University

15. He, Lei. Differential Filtering and Detexturing.

Degree: 2014, Texas A&M University

 Extracting valuable information from 2D or 3D visual data plays an important role in image and geometry processing. Surfaces obtained through a scanning process or… (more)

Subjects/Keywords: Surface denoising; Image detexturing; Bilateral filter

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, L. (2014). Differential Filtering and Detexturing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153626

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

He, Lei. “Differential Filtering and Detexturing.” 2014. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/153626.

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

MLA Handbook (7th Edition):

He, Lei. “Differential Filtering and Detexturing.” 2014. Web. 20 Apr 2019.

Vancouver:

He L. Differential Filtering and Detexturing. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/153626.

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

Council of Science Editors:

He L. Differential Filtering and Detexturing. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153626

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


Texas A&M University

16. Cao, Cheng. Combating User Misbehavior on Social Media.

Degree: PhD, Computer Science, 2017, Texas A&M University

 Social media encourages user participation and facilitates user’s self-expression like never before. While enriching user behavior in a spectrum of means, many social media platforms… (more)

Subjects/Keywords: Social Media; User Behavior; Misbehavior; Misinformation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cao, C. (2017). Combating User Misbehavior on Social Media. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/169604

Chicago Manual of Style (16th Edition):

Cao, Cheng. “Combating User Misbehavior on Social Media.” 2017. Doctoral Dissertation, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/169604.

MLA Handbook (7th Edition):

Cao, Cheng. “Combating User Misbehavior on Social Media.” 2017. Web. 20 Apr 2019.

Vancouver:

Cao C. Combating User Misbehavior on Social Media. [Internet] [Doctoral dissertation]. Texas A&M University; 2017. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/169604.

Council of Science Editors:

Cao C. Combating User Misbehavior on Social Media. [Doctoral Dissertation]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/169604


Texas A&M University

17. Tang, Jia. QoS-driven adaptive resource allocation for mobile wireless communications and networks.

Degree: 2009, Texas A&M University

 Quality-of-service (QoS) guarantees will play a critically important role in future mobile wireless networks. In this dissertation, we study a set of QoS-driven resource allocation… (more)

Subjects/Keywords: quality-of-service; resource allocation; wireless communications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tang, J. (2009). QoS-driven adaptive resource allocation for mobile wireless communications and networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1050

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

Tang, Jia. “QoS-driven adaptive resource allocation for mobile wireless communications and networks.” 2009. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1050.

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

MLA Handbook (7th Edition):

Tang, Jia. “QoS-driven adaptive resource allocation for mobile wireless communications and networks.” 2009. Web. 20 Apr 2019.

Vancouver:

Tang J. QoS-driven adaptive resource allocation for mobile wireless communications and networks. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1050.

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

Council of Science Editors:

Tang J. QoS-driven adaptive resource allocation for mobile wireless communications and networks. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1050

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


Texas A&M University

18. Gopal, Kreshna. Efficient case-based reasoning through feature weighting, and its application in protein crystallography.

Degree: 2009, Texas A&M University

 Data preprocessing is critical for machine learning, data mining, and pattern recognition. In particular, selecting relevant and non-redundant features in highdimensional data is important to… (more)

Subjects/Keywords: Case-Based Reasoning; Nearest Neighbor Learning; Feature Selection; Feature Weighting; Protein Crystallography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gopal, K. (2009). Efficient case-based reasoning through feature weighting, and its application in protein crystallography. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1906

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

Gopal, Kreshna. “Efficient case-based reasoning through feature weighting, and its application in protein crystallography.” 2009. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1906.

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

MLA Handbook (7th Edition):

Gopal, Kreshna. “Efficient case-based reasoning through feature weighting, and its application in protein crystallography.” 2009. Web. 20 Apr 2019.

Vancouver:

Gopal K. Efficient case-based reasoning through feature weighting, and its application in protein crystallography. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1906.

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

Council of Science Editors:

Gopal K. Efficient case-based reasoning through feature weighting, and its application in protein crystallography. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1906

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


Texas A&M University

19. Song, Yantao. The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers.

Degree: 2010, Texas A&M University

 This dissertation explores the necessary and sufficient conditions to solve a variant of the dining philosophers problem. This dining variant is defined by three properties:… (more)

Subjects/Keywords: Dining Philosophers; The eventually perfect failure detector; Wait-Freedom; Bounded Fairness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Song, Y. (2010). The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-112

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

Song, Yantao. “The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers.” 2010. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-112.

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

MLA Handbook (7th Edition):

Song, Yantao. “The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers.” 2010. Web. 20 Apr 2019.

Vancouver:

Song Y. The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-112.

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

Council of Science Editors:

Song Y. The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2008-12-112

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


Texas A&M University

20. Liu, Yang. Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems.

Degree: 2010, Texas A&M University

 NP-hard problems have numerous applications in various fields such as networks, computer systems, circuit design, etc. However, no efficient algorithms have been found for NP-hard… (more)

Subjects/Keywords: Algorithm; NP-hard; Measure; Parameterized Algorithms; Fixed-parameter Tractable

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Y. (2010). Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-7010

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

Liu, Yang. “Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems.” 2010. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-7010.

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

MLA Handbook (7th Edition):

Liu, Yang. “Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems.” 2010. Web. 20 Apr 2019.

Vancouver:

Liu Y. Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-7010.

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

Council of Science Editors:

Liu Y. Measure-Driven Algorithm Design and Analysis: A New Approach for Solving NP-hard Problems. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-7010

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


Texas A&M University

21. Pandey, Nikhil. Critical Cliques and Their Application to Influence Maximization in Online Social Networks.

Degree: 2012, Texas A&M University

 Graph decompositions have useful applications in optimization problems that are categorized as NP-Hard. Modular Decomposition of a graph is a technique to decompose the graph… (more)

Subjects/Keywords: critical cliques; influence maximization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pandey, N. (2012). Critical Cliques and Their Application to Influence Maximization in Online Social Networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102

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

Pandey, Nikhil. “Critical Cliques and Their Application to Influence Maximization in Online Social Networks.” 2012. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102.

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

MLA Handbook (7th Edition):

Pandey, Nikhil. “Critical Cliques and Their Application to Influence Maximization in Online Social Networks.” 2012. Web. 20 Apr 2019.

Vancouver:

Pandey N. Critical Cliques and Their Application to Influence Maximization in Online Social Networks. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102.

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

Council of Science Editors:

Pandey N. Critical Cliques and Their Application to Influence Maximization in Online Social Networks. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11102

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


Texas A&M University

22. Zhang, Fenghui. Effective algorithms and protocols for wireless networking: a topological approach.

Degree: 2008, Texas A&M University

 Much research has been done on wireless sensor networks. However, most protocols and algorithms for such networks are based on the ideal model Unit Disk… (more)

Subjects/Keywords: optimization; parameterized computation; wireless sensor networks; complexity; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, F. (2008). Effective algorithms and protocols for wireless networking: a topological approach. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/86012

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

Zhang, Fenghui. “Effective algorithms and protocols for wireless networking: a topological approach.” 2008. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/86012.

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

MLA Handbook (7th Edition):

Zhang, Fenghui. “Effective algorithms and protocols for wireless networking: a topological approach.” 2008. Web. 20 Apr 2019.

Vancouver:

Zhang F. Effective algorithms and protocols for wireless networking: a topological approach. [Internet] [Thesis]. Texas A&M University; 2008. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/86012.

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

Council of Science Editors:

Zhang F. Effective algorithms and protocols for wireless networking: a topological approach. [Thesis]. Texas A&M University; 2008. Available from: http://hdl.handle.net/1969.1/86012

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


Texas A&M University

23. Kostic, Dimitrije Nenad. Graph searching and a generalized parking function.

Degree: 2009, Texas A&M University

 Parking functions have been a focus of mathematical research since the mid-1970s. Various generalizations have been introduced since the mid-1990s and deep relationships between these… (more)

Subjects/Keywords: combinatorics; parking functions; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kostic, D. N. (2009). Graph searching and a generalized parking function. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1549

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

Kostic, Dimitrije Nenad. “Graph searching and a generalized parking function.” 2009. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1549.

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

MLA Handbook (7th Edition):

Kostic, Dimitrije Nenad. “Graph searching and a generalized parking function.” 2009. Web. 20 Apr 2019.

Vancouver:

Kostic DN. Graph searching and a generalized parking function. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1549.

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

Council of Science Editors:

Kostic DN. Graph searching and a generalized parking function. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1549

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

24. Oh, Eunseuk. On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks.

Degree: 2004, Texas A&M University

 As the size of networks increases continuously, dealing with networks with faulty nodes becomes unavoidable. In this dissertation, we introduce a new measure for network… (more)

Subjects/Keywords: strong fault tolerance; star networks; hypercube networks

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

Oh, E. (2004). On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/1284

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

Oh, Eunseuk. “On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks.” 2004. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/1284.

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

MLA Handbook (7th Edition):

Oh, Eunseuk. “On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks.” 2004. Web. 20 Apr 2019.

Vancouver:

Oh E. On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks. [Internet] [Thesis]. Texas A&M University; 2004. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/1284.

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

Council of Science Editors:

Oh E. On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks. [Thesis]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/1284

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

25. Garigipati, Pradeep. Duotone Surfaces: Division of a Closed Surface into Exactly Two Regions.

Degree: 2013, Texas A&M University

 In this thesis work, our main motivation is to create computer aided art work which can eventually transform into a sculpting tool. The work was… (more)

Subjects/Keywords: Computer Graphics; Texturing; Image Manipulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garigipati, P. (2013). Duotone Surfaces: Division of a Closed Surface into Exactly Two Regions. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/149501

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

Garigipati, Pradeep. “Duotone Surfaces: Division of a Closed Surface into Exactly Two Regions.” 2013. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/149501.

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

MLA Handbook (7th Edition):

Garigipati, Pradeep. “Duotone Surfaces: Division of a Closed Surface into Exactly Two Regions.” 2013. Web. 20 Apr 2019.

Vancouver:

Garigipati P. Duotone Surfaces: Division of a Closed Surface into Exactly Two Regions. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/149501.

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

Council of Science Editors:

Garigipati P. Duotone Surfaces: Division of a Closed Surface into Exactly Two Regions. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/149501

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

26. Zhang, Nan. Privacy-preserving data mining.

Degree: 2009, Texas A&M University

 In the research of privacy-preserving data mining, we address issues related to extracting knowledge from large amounts of data without violating the privacy of the… (more)

Subjects/Keywords: Data Mining; Privacy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, N. (2009). Privacy-preserving data mining. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1080

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

Zhang, Nan. “Privacy-preserving data mining.” 2009. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-1080.

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

MLA Handbook (7th Edition):

Zhang, Nan. “Privacy-preserving data mining.” 2009. Web. 20 Apr 2019.

Vancouver:

Zhang N. Privacy-preserving data mining. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1080.

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

Council of Science Editors:

Zhang N. Privacy-preserving data mining. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1080

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

27. Poznanovikj, Svetlana. Research on Combinatorial Statistics: Crossings and Nestings in Discrete Structures.

Degree: 2011, Texas A&M University

 We study the distribution of combinatorial statistics that exhibit a structure of crossings and nesting in various discrete structures, in particular, in set partitions, matchings,… (more)

Subjects/Keywords: crossings; nestings; set partitions; major index; fillings of moon polyominoes

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

Poznanovikj, S. (2011). Research on Combinatorial Statistics: Crossings and Nestings in Discrete Structures. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8297

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

Poznanovikj, Svetlana. “Research on Combinatorial Statistics: Crossings and Nestings in Discrete Structures.” 2011. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8297.

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

MLA Handbook (7th Edition):

Poznanovikj, Svetlana. “Research on Combinatorial Statistics: Crossings and Nestings in Discrete Structures.” 2011. Web. 20 Apr 2019.

Vancouver:

Poznanovikj S. Research on Combinatorial Statistics: Crossings and Nestings in Discrete Structures. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8297.

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

Council of Science Editors:

Poznanovikj S. Research on Combinatorial Statistics: Crossings and Nestings in Discrete Structures. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8297

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

28. Zhao, Xiaoyan. Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences.

Degree: 2012, Texas A&M University

 Understanding the mechanisms that regulate gene expression is a major challenge in biology. One of the most important tasks in this challenge is to identify… (more)

Subjects/Keywords: Computational Biology; Motif finding; Transcription

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, X. (2012). Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8834

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

Zhao, Xiaoyan. “Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences.” 2012. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8834.

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

MLA Handbook (7th Edition):

Zhao, Xiaoyan. “Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences.” 2012. Web. 20 Apr 2019.

Vancouver:

Zhao X. Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8834.

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

Council of Science Editors:

Zhao X. Improved Algorithms for Discovery of Transcription Factor Binding Sites in DNA Sequences. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8834

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

29. Xu, Yiliang. Systems and Algorithms for Automated Collaborative Observation using Networked Robotic Cameras.

Degree: 2011, Texas A&M University

 The development of telerobotic systems has evolved from Single Operator Single Robot (SOSR) systems to Multiple Operator Multiple Robot (MOMR) systems. The relationship between human… (more)

Subjects/Keywords: System; Algorithm; Collaborative Observation; Automated Observation; Networked Robotic Camera

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, Y. (2011). Systems and Algorithms for Automated Collaborative Observation using Networked Robotic Cameras. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10047

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

Xu, Yiliang. “Systems and Algorithms for Automated Collaborative Observation using Networked Robotic Cameras.” 2011. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10047.

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

MLA Handbook (7th Edition):

Xu, Yiliang. “Systems and Algorithms for Automated Collaborative Observation using Networked Robotic Cameras.” 2011. Web. 20 Apr 2019.

Vancouver:

Xu Y. Systems and Algorithms for Automated Collaborative Observation using Networked Robotic Cameras. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10047.

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

Council of Science Editors:

Xu Y. Systems and Algorithms for Automated Collaborative Observation using Networked Robotic Cameras. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10047

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

30. Cao, Cheng. Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding.

Degree: 2012, Texas A&M University

 In this thesis, we study two optimization problems which have a lot of important applications in diverse domains: Line Cover Problem (LCP) in Computational Geometry… (more)

Subjects/Keywords: Optimization Problems; Line Cover; Maximum Genus Embedding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cao, C. (2012). Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11073

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

Cao, Cheng. “Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding.” 2012. Thesis, Texas A&M University. Accessed April 20, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11073.

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

MLA Handbook (7th Edition):

Cao, Cheng. “Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding.” 2012. Web. 20 Apr 2019.

Vancouver:

Cao C. Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Apr 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11073.

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

Council of Science Editors:

Cao C. Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11073

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

[1] [2] [3]

.