130
Voted
TCS
2016
9 years 11 months 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...
125
Voted
TCS
2016
9 years 11 months 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...
128
Voted
TCS
2016
9 years 11 months 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...
213
Voted
TCS
2016
9 years 11 months 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...
129
Voted
TCS
2016
9 years 11 months ago
2016
We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that totally normed behaviours always have parallel decompositions,...
126
Voted
TCS
2016
9 years 11 months ago
2016
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...
130
Voted
TCS
2016
9 years 11 months ago
2016
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...
123
Voted
TCS
2016
9 years 11 months ago
2016
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...
123
Voted
TCS
2016
9 years 11 months ago
2016
137
Voted
TCS
2016
9 years 11 months ago
2016
A link stream is a collection of triplets (t, u, v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to s...