research
∙
12/29/2022
PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm
We consider a semi-supervised k-clustering problem where information is ...
share
research
∙
01/12/2021
Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition
An important problem in decision theory concerns the aggregation of indi...
research
∙
10/04/2020
A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem
The Replenishment Storage problem (RSP) is to minimize the storage capac...
research
∙
09/17/2020
Algorithms and Complexity for Variants of Covariates Fine Balance
We study here several variants of the covariates fine balance problem wh...
research
∙
07/14/2020
Network Flow Methods for the Minimum Covariates Imbalance Problem
The problem of balancing covariates arises in observational studies wher...
research
∙
06/25/2020
The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees
Decision trees are a widely used method for classification, both by them...
research
∙
06/24/2020
Spatial Pattern Recognition with Adjacency-Clustering: Improved Diagnostics for Semiconductor Wafer Bin Maps
In semiconductor manufacturing, statistical quality control hinges on an...
research
∙
05/14/2018
Algorithms and Complexity of Range Clustering
We introduce a novel criterion in clustering that seeks clusters with li...
research
∙
05/05/2018
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
This work presents the first algorithm for the problem of weighted onlin...
research
∙
05/05/2018
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals
This work presents the first algorithm for the problem of weighted onlin...
research
∙
07/26/2010
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Rapid advances in image acquisition and storage technology underline the...
research
∙
03/02/2008