Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"Rutgers University" +contributor:("Steiger, William")`

.
Showing records 1 – 19 of
19 total matches.

▼ Search Limiters

Rutgers University

1. Gupta, Mayank, 1990-. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.

Degree: MS, Computer Science, 2016, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/

► In this article we consider the problem of testing, for two nite sets of points in the Euclidean space, if their convex hulls are disjoint…
(more)

Subjects/Keywords: Convex sets

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gupta, Mayank, 1. (2016). A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/49973/

Chicago Manual of Style (16^{th} Edition):

Gupta, Mayank, 1990-. “A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.” 2016. Masters Thesis, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/49973/.

MLA Handbook (7^{th} Edition):

Gupta, Mayank, 1990-. “A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem.” 2016. Web. 28 Sep 2020.

Vancouver:

Gupta, Mayank 1. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. [Internet] [Masters thesis]. Rutgers University; 2016. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/.

Council of Science Editors:

Gupta, Mayank 1. A comparison of the triangle algorithm and sequential minimal optimization algorithm for solving the hard margin problem. [Masters Thesis]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49973/

Rutgers University

2. Shabbir, Mudassir. Some results in computational and combinatorial geometry.

Degree: PhD, Computer Science, 2014, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/45458/

►

In this thesis we present some new results in the field of discrete and computational geometry. The techniques and tools developed to achieve these results… (more)

Subjects/Keywords: Discrete geometry; Computational geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shabbir, M. (2014). Some results in computational and combinatorial geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/45458/

Chicago Manual of Style (16^{th} Edition):

Shabbir, Mudassir. “Some results in computational and combinatorial geometry.” 2014. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/45458/.

MLA Handbook (7^{th} Edition):

Shabbir, Mudassir. “Some results in computational and combinatorial geometry.” 2014. Web. 28 Sep 2020.

Vancouver:

Shabbir M. Some results in computational and combinatorial geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2014. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/45458/.

Council of Science Editors:

Shabbir M. Some results in computational and combinatorial geometry. [Doctoral Dissertation]. Rutgers University; 2014. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/45458/

Rutgers University

3. Herdade, Simao, 1984-. Stability results in additive combinatorics and graph theory.

Degree: PhD, Mathematics, 2015, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/

►

A general problem in Extremal Combinatorics asks about the maximum size of a collection of finite objects satisfying certain restrictions, and an ideal solution to… (more)

Subjects/Keywords: Combinatorial analysis; Stability; Graph theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Herdade, Simao, 1. (2015). Stability results in additive combinatorics and graph theory. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/47413/

Chicago Manual of Style (16^{th} Edition):

Herdade, Simao, 1984-. “Stability results in additive combinatorics and graph theory.” 2015. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/47413/.

MLA Handbook (7^{th} Edition):

Herdade, Simao, 1984-. “Stability results in additive combinatorics and graph theory.” 2015. Web. 28 Sep 2020.

Vancouver:

Herdade, Simao 1. Stability results in additive combinatorics and graph theory. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/.

Council of Science Editors:

Herdade, Simao 1. Stability results in additive combinatorics and graph theory. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/47413/

Rutgers University

4. Zhao, Jihui, 1971-. Partitioning problems in discrete and computational geometry:.

Degree: PhD, Computer Science, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168

►

Many interesting problems in Discrete and Computational Geometry involve partitioning. A main question is whether a given set, or sets, may be separated into parts… (more)

Subjects/Keywords: Discrete geometry; Geometry – Data processing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhao, Jihui, 1. (2010). Partitioning problems in discrete and computational geometry:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168

Chicago Manual of Style (16^{th} Edition):

Zhao, Jihui, 1971-. “Partitioning problems in discrete and computational geometry:.” 2010. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168.

MLA Handbook (7^{th} Edition):

Zhao, Jihui, 1971-. “Partitioning problems in discrete and computational geometry:.” 2010. Web. 28 Sep 2020.

Vancouver:

Zhao, Jihui 1. Partitioning problems in discrete and computational geometry:. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168.

Council of Science Editors:

Zhao, Jihui 1. Partitioning problems in discrete and computational geometry:. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168

Rutgers University

5. Jamshed, Asif. Embedding spanning subgraphs into large dense graphs.

Degree: PhD, Computer Science, 2010, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056417

►

In this thesis we are going to present some results on embedding spanning subgraphs into large dense graphs. Spanning Trees Bollob'as conjectured that if G… (more)

Subjects/Keywords: Hamiltonian graph theory; Spanning trees (Graph theory); Embeddings (Mathematics)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jamshed, A. (2010). Embedding spanning subgraphs into large dense graphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056417

Chicago Manual of Style (16^{th} Edition):

Jamshed, Asif. “Embedding spanning subgraphs into large dense graphs.” 2010. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056417.

MLA Handbook (7^{th} Edition):

Jamshed, Asif. “Embedding spanning subgraphs into large dense graphs.” 2010. Web. 28 Sep 2020.

Vancouver:

Jamshed A. Embedding spanning subgraphs into large dense graphs. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056417.

Council of Science Editors:

Jamshed A. Embedding spanning subgraphs into large dense graphs. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056417

Rutgers University

6. Khan, Imdadullah, 1980-. Spanning subgraphs in graphs and hypergraphs.

Degree: PhD, Computer Science, 2011, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

►

This thesis consists of three new fundamental results on the existence of spanning subgraphs in graphs and hypergraphs. Cycle Factors in Graphs: A classical conjecture… (more)

Subjects/Keywords: Graph theory; Hypergraphs

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khan, Imdadullah, 1. (2011). Spanning subgraphs in graphs and hypergraphs. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

Chicago Manual of Style (16^{th} Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

MLA Handbook (7^{th} Edition):

Khan, Imdadullah, 1980-. “Spanning subgraphs in graphs and hypergraphs.” 2011. Web. 28 Sep 2020.

Vancouver:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299.

Council of Science Editors:

Khan, Imdadullah 1. Spanning subgraphs in graphs and hypergraphs. [Doctoral Dissertation]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061299

Rutgers University

7. Mittal, Rajat. Application of SDP to product rules and quantum query complexity.

Degree: PhD, Computer Science, 2011, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061359

►

In recent years, semidefinite programming has played a vital role in shaping complexity theory and quantum computing. There have been numerous applications ranging from estimating… (more)

Subjects/Keywords: Computer programming; Quantum theory; Querying (Computer science)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mittal, R. (2011). Application of SDP to product rules and quantum query complexity. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061359

Chicago Manual of Style (16^{th} Edition):

Mittal, Rajat. “Application of SDP to product rules and quantum query complexity.” 2011. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061359.

MLA Handbook (7^{th} Edition):

Mittal, Rajat. “Application of SDP to product rules and quantum query complexity.” 2011. Web. 28 Sep 2020.

Vancouver:

Mittal R. Application of SDP to product rules and quantum query complexity. [Internet] [Doctoral dissertation]. Rutgers University; 2011. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061359.

Council of Science Editors:

Mittal R. Application of SDP to product rules and quantum query complexity. [Doctoral Dissertation]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000061359

8. Wolf, Charles, 1989-. Incidence problems in discrete geometry.

Degree: PhD, Mathematics, 2017, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/54042/

►

Over the past decade, discrete geometry research has flourished with clever uses of algebraic methods. The polynomial method has had a deep impact on a… (more)

Subjects/Keywords: Discrete geometry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wolf, Charles, 1. (2017). Incidence problems in discrete geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54042/

Chicago Manual of Style (16^{th} Edition):

Wolf, Charles, 1989-. “Incidence problems in discrete geometry.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54042/.

MLA Handbook (7^{th} Edition):

Wolf, Charles, 1989-. “Incidence problems in discrete geometry.” 2017. Web. 28 Sep 2020.

Vancouver:

Wolf, Charles 1. Incidence problems in discrete geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54042/.

Council of Science Editors:

Wolf, Charles 1. Incidence problems in discrete geometry. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54042/

9. Chen, He, 1990-. Molecular geometry optimization by artificial neural networks.

Degree: MS, Computer Science, 2019, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/60070/

► Articial neural network is revolutionizing many areas in science and technology. We applied articial neural network to solve a non-linear optimization problem in computational chemistry,…
(more)

Subjects/Keywords: Neural networks (Computer science); Stereochemistry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chen, He, 1. (2019). Molecular geometry optimization by artificial neural networks. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/60070/

Chicago Manual of Style (16^{th} Edition):

Chen, He, 1990-. “Molecular geometry optimization by artificial neural networks.” 2019. Masters Thesis, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/60070/.

MLA Handbook (7^{th} Edition):

Chen, He, 1990-. “Molecular geometry optimization by artificial neural networks.” 2019. Web. 28 Sep 2020.

Vancouver:

Chen, He 1. Molecular geometry optimization by artificial neural networks. [Internet] [Masters thesis]. Rutgers University; 2019. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60070/.

Council of Science Editors:

Chen, He 1. Molecular geometry optimization by artificial neural networks. [Masters Thesis]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60070/

10. Basit, Abdul, 1987-. Some applications of algebraic methods in combinatorial geometry.

Degree: PhD, Computer Science, 2017, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/

►

This dissertation explores problems in combinatorial geometry relating to incidences and to applications of incidence problems in other areas of combinatorics. In recent years, various… (more)

Subjects/Keywords: Combinatorial geometry; Combinatorial analysis

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Basit, Abdul, 1. (2017). Some applications of algebraic methods in combinatorial geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54176/

Chicago Manual of Style (16^{th} Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

MLA Handbook (7^{th} Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Web. 28 Sep 2020.

Vancouver:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

Council of Science Editors:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/

11. Govindan, Priya, 1983-. Core structure and influence in social networks.

Degree: PhD, Computer Science, 2018, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/56009/

►

Structure of social connections and interpersonal dynamics based on user behavior shapes the culture, politics and economics of the world. Building consumer products and services,… (more)

Subjects/Keywords: Social networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Govindan, Priya, 1. (2018). Core structure and influence in social networks. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/56009/

Chicago Manual of Style (16^{th} Edition):

Govindan, Priya, 1983-. “Core structure and influence in social networks.” 2018. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/56009/.

MLA Handbook (7^{th} Edition):

Govindan, Priya, 1983-. “Core structure and influence in social networks.” 2018. Web. 28 Sep 2020.

Vancouver:

Govindan, Priya 1. Core structure and influence in social networks. [Internet] [Doctoral dissertation]. Rutgers University; 2018. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/56009/.

Council of Science Editors:

Govindan, Priya 1. Core structure and influence in social networks. [Doctoral Dissertation]. Rutgers University; 2018. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/56009/

12. Leonardos, Nikolaos, 1978-. Information theory methods in communication complexity.

Degree: Computer Science, 2012, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064145

Subjects/Keywords: Communication—Methodology; Communication models

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Leonardos, Nikolaos, 1. (2012). Information theory methods in communication complexity. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064145

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Leonardos, Nikolaos, 1978-. “Information theory methods in communication complexity.” 2012. Thesis, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064145.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Leonardos, Nikolaos, 1978-. “Information theory methods in communication complexity.” 2012. Web. 28 Sep 2020.

Vancouver:

Leonardos, Nikolaos 1. Information theory methods in communication complexity. [Internet] [Thesis]. Rutgers University; 2012. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064145.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Leonardos, Nikolaos 1. Information theory methods in communication complexity. [Thesis]. Rutgers University; 2012. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064145

Not specified: Masters Thesis or Doctoral Dissertation

13. Wang, Lei, 1978-. Some problems on discrete geometry and combinatorics.

Degree: Computer Science, 2012, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064188

Subjects/Keywords: Combinatorial analysis; Discrete geometry; Partitions (Mathematics)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Lei, 1. (2012). Some problems on discrete geometry and combinatorics. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064188

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wang, Lei, 1978-. “Some problems on discrete geometry and combinatorics.” 2012. Thesis, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064188.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Lei, 1978-. “Some problems on discrete geometry and combinatorics.” 2012. Web. 28 Sep 2020.

Vancouver:

Wang, Lei 1. Some problems on discrete geometry and combinatorics. [Internet] [Thesis]. Rutgers University; 2012. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064188.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang, Lei 1. Some problems on discrete geometry and combinatorics. [Thesis]. Rutgers University; 2012. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064188

Not specified: Masters Thesis or Doctoral Dissertation

14. Dobson, Andrew, 1988-. Compact representations for efficient robot motion planning with formal guarantees.

Degree: PhD, Computer Science, 2017, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/55459/

►

This work provides compact representations for single- and multi-robot motion planning in the context of prehensile robot manipulation. This work describes the asymptotic near-optimality and… (more)

Subjects/Keywords: Robots – Motion; Robots – Control systems

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dobson, Andrew, 1. (2017). Compact representations for efficient robot motion planning with formal guarantees. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55459/

Chicago Manual of Style (16^{th} Edition):

Dobson, Andrew, 1988-. “Compact representations for efficient robot motion planning with formal guarantees.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/55459/.

MLA Handbook (7^{th} Edition):

Dobson, Andrew, 1988-. “Compact representations for efficient robot motion planning with formal guarantees.” 2017. Web. 28 Sep 2020.

Vancouver:

Dobson, Andrew 1. Compact representations for efficient robot motion planning with formal guarantees. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55459/.

Council of Science Editors:

Dobson, Andrew 1. Compact representations for efficient robot motion planning with formal guarantees. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55459/

15. Shen, Jie, 1989-. Learning from structured data: theory, algorithms, and applications.

Degree: PhD, Computer Science, 2018, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/59227/

► The last few years have witnessed the rise of the big data era, which features the prevalence of data sets that are high-dimensional, noisy, and…
(more)

Subjects/Keywords: Big data; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Shen, Jie, 1. (2018). Learning from structured data: theory, algorithms, and applications. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/59227/

Chicago Manual of Style (16^{th} Edition):

Shen, Jie, 1989-. “Learning from structured data: theory, algorithms, and applications.” 2018. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/59227/.

MLA Handbook (7^{th} Edition):

Shen, Jie, 1989-. “Learning from structured data: theory, algorithms, and applications.” 2018. Web. 28 Sep 2020.

Vancouver:

Shen, Jie 1. Learning from structured data: theory, algorithms, and applications. [Internet] [Doctoral dissertation]. Rutgers University; 2018. [cited 2020 Sep 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/59227/.

Council of Science Editors:

Shen, Jie 1. Learning from structured data: theory, algorithms, and applications. [Doctoral Dissertation]. Rutgers University; 2018. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/59227/

16. Mukkamala, V S Padmini, 1983-. Obstacles, slopes and tic-tac-toe: an excursion in discrete geometry and combinatorial game theory.

Degree: Mathematics, 2011, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063727

Subjects/Keywords: Combinatorial analysis; Discrete geometry; Mathematical models

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mukkamala, V S Padmini, 1. (2011). Obstacles, slopes and tic-tac-toe: an excursion in discrete geometry and combinatorial game theory. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063727

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Mukkamala, V S Padmini, 1983-. “Obstacles, slopes and tic-tac-toe: an excursion in discrete geometry and combinatorial game theory.” 2011. Thesis, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063727.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mukkamala, V S Padmini, 1983-. “Obstacles, slopes and tic-tac-toe: an excursion in discrete geometry and combinatorial game theory.” 2011. Web. 28 Sep 2020.

Vancouver:

Mukkamala, V S Padmini 1. Obstacles, slopes and tic-tac-toe: an excursion in discrete geometry and combinatorial game theory. [Internet] [Thesis]. Rutgers University; 2011. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063727.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mukkamala, V S Padmini 1. Obstacles, slopes and tic-tac-toe: an excursion in discrete geometry and combinatorial game theory. [Thesis]. Rutgers University; 2011. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000063727

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

17. Mosteiro, Miguel. Upper and lower bounds in radio networks.

Degree: PhD, Computer Science, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13483

► Sensor nodes are very weak computers that get distributed at random on a surface in order to achieve a large-scale sensing task. Once deployed, they…
(more)

Subjects/Keywords: Sensor networks; Multisensor data fusion; Signal processing; Operator theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mosteiro, M. (2007). Upper and lower bounds in radio networks. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13483

Chicago Manual of Style (16^{th} Edition):

Mosteiro, Miguel. “Upper and lower bounds in radio networks.” 2007. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13483.

MLA Handbook (7^{th} Edition):

Mosteiro, Miguel. “Upper and lower bounds in radio networks.” 2007. Web. 28 Sep 2020.

Vancouver:

Mosteiro M. Upper and lower bounds in radio networks. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13483.

Council of Science Editors:

Mosteiro M. Upper and lower bounds in radio networks. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.13483

Rutgers University

18. Mesterharm, Chris. Improving on-line learning.

Degree: PhD, Computer Science, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16748

►

In this dissertation, we consider techniques to improve the performance and applicability of algorithms used for on-line learning. We organize these techniques according to the… (more)

Subjects/Keywords: Machine learning; Computational learning theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mesterharm, C. (2007). Improving on-line learning. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16748

Chicago Manual of Style (16^{th} Edition):

Mesterharm, Chris. “Improving on-line learning.” 2007. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16748.

MLA Handbook (7^{th} Edition):

Mesterharm, Chris. “Improving on-line learning.” 2007. Web. 28 Sep 2020.

Vancouver:

Mesterharm C. Improving on-line learning. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16748.

Council of Science Editors:

Mesterharm C. Improving on-line learning. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16748

Rutgers University

19. Kaufman, Daniel M., 1972-. Coupled principles for computational frictional contact mechanics:.

Degree: PhD, Computer Science, 2009, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052252

►

Methods for simulating frictional contact response are in high demand in robotics, graphics, biomechanics, structural engineering, and many other fields where the accurate modeling of… (more)

Subjects/Keywords: Contact mechanics – Mathematical models; Friction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kaufman, Daniel M., 1. (2009). Coupled principles for computational frictional contact mechanics:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052252

Chicago Manual of Style (16^{th} Edition):

Kaufman, Daniel M., 1972-. “Coupled principles for computational frictional contact mechanics:.” 2009. Doctoral Dissertation, Rutgers University. Accessed September 28, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052252.

MLA Handbook (7^{th} Edition):

Kaufman, Daniel M., 1972-. “Coupled principles for computational frictional contact mechanics:.” 2009. Web. 28 Sep 2020.

Vancouver:

Kaufman, Daniel M. 1. Coupled principles for computational frictional contact mechanics:. [Internet] [Doctoral dissertation]. Rutgers University; 2009. [cited 2020 Sep 28]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052252.

Council of Science Editors:

Kaufman, Daniel M. 1. Coupled principles for computational frictional contact mechanics:. [Doctoral Dissertation]. Rutgers University; 2009. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052252