TCS
2016
8 years 10 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...
TCS
2016
8 years 10 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...
TCS
2016
8 years 10 days 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,...
TCS
2016
8 years 10 days 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...
TCS
2016
8 years 10 days 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...
TCS
2016
8 years 10 days 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...
TCS
2016
8 years 10 days ago
2016
TCS
2016
8 years 10 days 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...
TCS
2016
8 years 10 days ago
2016
In this paper, we consider the number of 2-protected nodes in random digital trees. Results for the mean and variance of this number for tries have been obtained by Gaither, Homma...
TCS
2016
8 years 10 days ago
2016
The notion of duty cycling is common in problems which seek to maximize the lifetime of a wireless sensor network. In the duty cycling model, sensors are grouped into shifts that ...