Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
TCS
2016
4 years 10 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
4 years 10 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
4 years 10 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
4 years 10 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
4 years 10 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
4 years 10 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...
TCS
2016
4 years 10 months ago
Computing maximal cliques in link streams
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...
Jordan Viard, Matthieu Latapy, Clémence Mag...
TCS
2016
4 years 10 months ago
On 2-protected nodes in random digital trees
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...
Michael Fuchs 0001, C.-K. Lee, G.-R. Yu
TCS
2016
4 years 10 months ago
Changing of the guards: Strip cover with duty cycling
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 ...
Amotz Bar-Noy, Ben Baumer, Dror Rawitz
books