
KIGLIS: Smart Networks for Smart Cities
Smart cities will be characterized by a variety of intelligent and netwo...
read it

Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard Thresholding
In this paper, we study the problem of estimating latent variable models...
read it

Estimating Stochastic Linear Combination of Nonlinear Regressions Efficiently and Scalably
Recently, many machine learning and statistical models such as nonlinea...
read it

Consistent kMedian: Simpler, Better and Robust
In this paper we introduce and study the online consistent kclustering ...
read it

HierarchyBased Algorithms for Minimizing Makespan under Precedence and Communication Constraints
We consider the classic problem of scheduling jobs with precedence const...
read it

Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
We study the classic problem of scheduling n precedence constrained unit...
read it

Covering the Relational Join
In this paper, we initiate a theoretical study of what we call the join ...
read it

Topology Dependent Bounds For FAQs
In this paper, we prove topology dependent bounds on the number of round...
read it

The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models
In this paper we study the facility location problem in the online with ...
read it

Facility Location Problem in Differential Privacy Model Revisited
In this paper we study the uncapacitated facility location problem in th...
read it

Tight Approximation for Variants of Directed Steiner Tree via StateTree Decomposition and Linear Programming Rounding
Directed Steiner Tree (DST) is a central problem in combinatorial optimi...
read it

Optimizing Data Intensive Flows for Networks on Chips
Data flow analysis and optimization is considered for homogeneous rectan...
read it

O(^2k/k)Approximation Algorithm for Directed Steiner Tree: A Tight QuasiPolynomialTime Algorithm
In the Directed Steiner Tree (DST) problem we are given an nvertex dire...
read it

Distributed kClustering for Data with Heavy Noise
In this paper, we consider the kcenter/median/means clustering with out...
read it

Approximation algorithms for stochastic clustering
We consider stochastic settings for clustering, and develop provablygoo...
read it

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flowtime
We consider the classic scheduling problem of minimizing the total weigh...
read it

Flowtime Optimization For Concurrent OpenShop and Precedence Constrained Scheduling Models
Scheduling a set of jobs over a collection of machines is a fundamental ...
read it

On Facility Location with General Lower Bounds
In this paper, we give the first constant approximation algorithm for th...
read it

Constant Approximation for kMedian and kMeans with Outliers via Iterative Rounding
In this paper, we present a novel iterative rounding framework for many ...
read it
Shi Li
is this you? claim profile