Picture for Dorit S. Hochbaum

Dorit S. Hochbaum

PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm

Add code
Dec 29, 2022
Viaarxiv icon

Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition

Add code
Jan 12, 2021
Figure 1 for Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition
Figure 2 for Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition
Figure 3 for Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition
Figure 4 for Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition
Viaarxiv icon

The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees

Add code
Jun 25, 2020
Figure 1 for The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees
Figure 2 for The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees
Figure 3 for The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees
Figure 4 for The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees
Viaarxiv icon

Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems

Add code
Oct 18, 2010
Figure 1 for Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Figure 2 for Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Figure 3 for Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Figure 4 for Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Viaarxiv icon

Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions

Add code
Mar 02, 2008
Figure 1 for Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions
Figure 2 for Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions
Figure 3 for Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions
Figure 4 for Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging. Part I: Normalized cut and ratio regions
Viaarxiv icon