Advanced search options

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

You searched for `+publisher:"Rutgers University" +contributor:("Kalantari, Bahman")`

.
Showing records 1 – 6 of
6 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 October 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 Oct 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 Oct 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. Winter, Esther, 1982-. Computer-supported collaborative video analysis of teaching and learning.

Degree: PhD, Education, 2017, Rutgers University

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

►

The process of intersubjective meaning making is an important characteristic of learning which occurs through social engagement. However, little research has been conducted to explore… (more)

Subjects/Keywords: Observation (Educational method); Teachers – Training of – Audio-visual aids

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Winter, Esther, 1. (2017). Computer-supported collaborative video analysis of teaching and learning. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55770/

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

Winter, Esther, 1982-. “Computer-supported collaborative video analysis of teaching and learning.” 2017. Doctoral Dissertation, Rutgers University. Accessed October 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/55770/.

MLA Handbook (7^{th} Edition):

Winter, Esther, 1982-. “Computer-supported collaborative video analysis of teaching and learning.” 2017. Web. 28 Oct 2020.

Vancouver:

Winter, Esther 1. Computer-supported collaborative video analysis of teaching and learning. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Oct 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55770/.

Council of Science Editors:

Winter, Esther 1. Computer-supported collaborative video analysis of teaching and learning. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55770/

3. Van Ness, Cheryl K., 1968-. Creating and using VMCAnalytics for preservice teachers' studying of argumentation.

Degree: PhD, Education, 2017, Rutgers University

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

►

Teacher recognition of student argumentation has been addressed by many researchers (e.g., Schwarz, 2009; Krummheuer, 1995; Bieda & Lepak, 2014; Whitenack & Yackel, 2002). Further,… (more)

Subjects/Keywords: Debates and debating; Motivation in education

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Van Ness, Cheryl K., 1. (2017). Creating and using VMCAnalytics for preservice teachers' studying of argumentation. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/52283/

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

Van Ness, Cheryl K., 1968-. “Creating and using VMCAnalytics for preservice teachers' studying of argumentation.” 2017. Doctoral Dissertation, Rutgers University. Accessed October 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/52283/.

MLA Handbook (7^{th} Edition):

Van Ness, Cheryl K., 1968-. “Creating and using VMCAnalytics for preservice teachers' studying of argumentation.” 2017. Web. 28 Oct 2020.

Vancouver:

Van Ness, Cheryl K. 1. Creating and using VMCAnalytics for preservice teachers' studying of argumentation. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Oct 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52283/.

Council of Science Editors:

Van Ness, Cheryl K. 1. Creating and using VMCAnalytics for preservice teachers' studying of argumentation. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52283/

4. 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

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

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

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

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 Oct 2020.

Vancouver:

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

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

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

Rutgers University

5. 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 October 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 Oct 2020.

Vancouver:

Zhao, Jihui 1. Partitioning problems in discrete and computational geometry:. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2020 Oct 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

6. Imielinska, Celina Z. A general class of heuristics for constrained forest and cycle problems.

Degree: PhD, Computer Science, 1993, Rutgers University

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

►

Let G = (V, E) be a connected, undirected, edge-weighted graph. A subgraph of G satisfying a certain criteria will be called an optimal solution… (more)

Subjects/Keywords: Heuristic algorithms; Traveling-salesman problem; Algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Imielinska, C. Z. (1993). A general class of heuristics for constrained forest and cycle problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/52073/

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

Imielinska, Celina Z. “A general class of heuristics for constrained forest and cycle problems.” 1993. Doctoral Dissertation, Rutgers University. Accessed October 28, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/52073/.

MLA Handbook (7^{th} Edition):

Imielinska, Celina Z. “A general class of heuristics for constrained forest and cycle problems.” 1993. Web. 28 Oct 2020.

Vancouver:

Imielinska CZ. A general class of heuristics for constrained forest and cycle problems. [Internet] [Doctoral dissertation]. Rutgers University; 1993. [cited 2020 Oct 28]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52073/.

Council of Science Editors:

Imielinska CZ. A general class of heuristics for constrained forest and cycle problems. [Doctoral Dissertation]. Rutgers University; 1993. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52073/