Sciweavers

Share
TCS
2016
3 years 1 months ago
Minimizing average flow-time under knapsack constraint
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...
Suman Kalyan Bera, Syamantak Das, Amit Kumar 0001
TCS
2016
3 years 1 months ago
Capacitated Max-Batching with interval graph compatibilities
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...
Tim Nonner
TCS
2016
3 years 1 months ago
On competitive recommendations
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...
Jara Uitto, Roger Wattenhofer
TCS
2016
3 years 1 months ago
Hardness of computing width parameters based on branch decompositions over the vertex set
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...
Sigve Hortemo Sæther, Martin Vatshelle
TCS
2016
3 years 1 months ago
Adaptive metric dimensionality reduction
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...
Lee-Ad Gottlieb, Aryeh Kontorovich, Robert Krauthg...
TCS
2016
3 years 1 months ago
Unique parallel decomposition in branching and weak bisimulation semantics
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that totally normed behaviours always have parallel decompositions,...
Bas Luttik
TCS
2016
3 years 1 months ago
Order compression schemes
Sample compression schemes are schemes for “encoding” a set of examples in a small subset of examples. The long-standing open sample compression conjecture states that, for any...
Malte Darnstädt, Thorsten Kiss, Hans Ulrich S...
TCS
2016
3 years 1 months ago
A synthetic axiomatization of Map Theory
This paper presents a substantially simplified axiomatization of Map Theory and proves the consistency of this axiomatization (called MT) in ZFC under the assumption that there e...
Chantal Berline, Klaus Grue
TCS
2016
3 years 1 months ago
The number and degree distribution of spanning trees in the Tower of Hanoi graph
The number of spanning trees of a graph is an important invariant related to topological and dynamic properties of the graph, such as its reliability, communication aspects, synch...
Zhongzhi Zhang, Shunqi Wu, Mingyun Li, Francesc Co...
books