128
click to vote
TCS
2016
10 years 15 days ago
2016
We give the first logarithmic approximation for minimizing average flow-time of jobs in the subset parallel machine setting (also called the restricted assignment setting) under...
137
click to vote
TCS
2016
10 years 15 days ago
2016
We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in...
133
click to vote
TCS
2016
10 years 15 days ago
2016
We are given an unknown binary matrix, where the entries correspond to preferences of users on items. We want to find at least one 1-entry in each row with a minimum number of que...
138
click to vote
TCS
2016
10 years 15 days ago
2016
Many width parameters of graphs are defined using branch decompositions over the vertex set of the graph and a corresponding cut-function. In this paper, we give a general framew...
231
click to vote
TCS
2016
10 years 15 days ago
2016
Abstract. We study data-adaptive dimensionality reduction in the context of supervised learning in general metric spaces. Our main statistical contribution is a generalization boun...