Search Results for author:
Found 6 papers, 2 papers with code
PCCC: The Pairwise-Confidence-Constraints-Clustering Algorithm
Unlike existing algorithms, our algorithm scales to large-scale instances with up to 60, 000 objects, 100 clusters, and millions of cannot-link constraints (which are the most challenging constraints to incorporate).
Joint aggregation of cardinal and ordinal evaluations with an application to a student paper competition
The aggregation problem in this competition poses two challenges.
A Fully Polynomial Time Approximation Scheme for the Replenishment Storage Problem
The Replenishment Storage problem (RSP) is to minimize the storage capacity requirement for a deterministic demand, multi-item inventory system where each item has a given reorder size and cycle length.
Data Structures and Algorithms
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 themselves and as the building blocks of multiple different ensemble learning methods.
Efficient algorithms to discover alterations with complementary functional association in cancer
The availability of quantitative target profiles, from genetic perturbations or from clinical phenotypes, provides additional information that can be leveraged to improve the identification of cancer related gene sets by discovering groups with complementary functional associations with such targets.
HNCcorr: A Novel Combinatorial Approach for Cell Identification in Calcium-Imaging Movies
The HNCcorr algorithm achieves the best known results for the cell identification benchmark of Neurofinder, and guarantees an optimal solution to the underlying deterministic optimization model resulting in a transparent mapping from input data to outcome.
Quantitative Methods Optimization and Control Neurons and Cognition
