research
∙
06/05/2023
Learning from Noisy Labels Generated by Extremely Point Annotations for OCT Fluid Segmentation
Automatic segmentation of fluid in OCT (Optical Coherence Tomography) im...
share
research
∙
07/02/2022
Sum-of-Max Partition under a Knapsack Constraint
Sequence partition problems arise in many fields, such as sequential dat...
research
∙
04/24/2022
String Rearrangement Inequalities and a Total Order Between Primitive Words
We study the following rearrangement problem: Given n words, rearrange a...
research
∙
10/28/2021
Dispensed Transformer Network for Unsupervised Domain Adaptation
Accurate segmentation is a crucial step in medical image analysis and ap...
research
∙
03/18/2020
A Generalization of Self-Improving Algorithms
Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting ...
research
∙
06/20/2019
Extensions of Self-Improving Sorters
Ailon et al. (SICOMP 2011) proposed a self-improving sorter that tunes i...
research
∙
02/01/2019
A note on self-improving sorting with hidden partitions
We study self-improving sorting with hidden partitions. Our result is an...
research
∙
01/28/2019
On the Complexity of Computing the Topology of Real Algebraic Space Curves
In this paper, we present a deterministic algorithm to find a strong gen...
research
∙
08/26/2018
DeepTracker: Visualizing the Training Process of Convolutional Neural Networks
Deep convolutional neural networks (CNNs) have achieved remarkable succe...
research
∙
12/14/2017
Linear time Minimum Area All-flush Triangles Circumscribing a Convex Polygon
We study the problem of computing the minimum area triangle that circums...
research
∙
12/14/2017
Minimum Area All-flush Triangles Circumscribing a Convex Polygon
In this paper, we consider the problem of computing the minimum area tri...
research
∙
11/01/2017
Finding all Maximal Area Parallelograms in a Convex Polygon
We consider the problem of finding the maximum area parallelogram (MAP) ...
research
∙
07/13/2017
