Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Chaya Gurwitz

dblp:29/1124 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
3D vision · 100%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › continuous optimization
nonlinear optimization		 0.011989
A Globally Convergent Algorithm for Minimizing Over the Rotation Group of Quadratic Forms · IEEE Trans. Pattern Anal. Mach. Intell. 1989
Mathematical optimization › continuous optimization › nonlinear optimization
sequential quadratic programming		 0.011989
A Globally Convergent Algorithm for Minimizing Over the Rotation Group of Quadratic Forms · IEEE Trans. Pattern Anal. Mach. Intell. 1989

Methods — techniques the papers use, named apart from their topics

sequential quadratic programming · 0.0rotation group constraints · 0.0
YearPublicationVenuePosition
2003 Nifty assignments
abstract
No abstract available.
Nick Parlante, Jeffrey L. Popyack, Stuart Reges, Stephen Weiss, Scott D. Dexter, Chaya Gurwitz, Joseph L. Zachary, Grant Braught
 SIGCSE6
1998 The Internet as a motivating theme in a math/computer core course for nonmajors
abstract
The challenge of a computer literacy course is to present general principles of computer science, while at the same time engaging students who are nonmajors and demonstrating the relevance of the subject. In this paper we describe our experience with a course that uses the Internet as a motivating theme to introduce students to fundamental concepts of computer science. The students found the course interesting and were visibly stimulated by the material. In comparison with previous semesters, the students left the course with more practical skills as well as a greater appreciation of the interrelations between mathematics and computer science.
Chaya Gurwitz
 SIGCSE1
1995 Achieving a uniform interface for binary tree implementations
abstract
One of the basic principles taught in a data structures course is that an application program should be independent of the implementation of any particular data structure it uses. This policy breaks down when binary trees are introduced, because the interfaces for the various representations of binary trees are not uniform. In particular, implementing a binary tree by using an implicit array generally requires the array itself to be passed as a parameter to any function that manipulates the tree. In this paper we present an approach for defining the implicit array representation of a binary tree. Our definition makes the underlying array transparent to the user. This allows us to describe a uniform interface for a binary tree module that can be used by an application program regardless of the particular implementation of the tree.
Chaya Gurwitz
 SIGCSE1
1992 A test for cancellation errors in quasi-Newton methods
abstract
It has recently been shown that cancellation errors in a quasi-Newton method can increase without bound as the method converges. A simple test is presented to determine when cancellation errors could lead to significant contamination of the approximating matrix.
Chaya Gurwitz
 ACM Trans. Math. Softw.1
1989 A Globally Convergent Algorithm for Minimizing Over the Rotation Group of Quadratic Forms
abstract
The authors describe a numerical procedure for solving problems involving minimization over the rotation group of quadratic forms which arise in connection with problems of computer vision. The algorithm presented is a sequential quadratic programming method which takes advantage of the special structure of the problem constraints. It is demonstrate that the method is globally convergent.>
Chaya Gurwitz, Michael L. Overton
 IEEE Trans. Pattern Anal. Mach. Intell.1