Sciweavers

TCS
2016
7 years 11 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
7 years 11 months ago
Average-case complexity of the min-sum matrix product problem
rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus...
Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Ya...
TCS
2016
7 years 11 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
7 years 11 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
7 years 11 months ago
Computational complexity of covering three-vertex multigraphs
Abstract. A covering projection from a graph G to a graph H is a mapping of the vertices of G to the vertices of H such that, for every vertex v of G, the neighborhood of v is mapp...
Jan Kratochvíl, Jan Arne Telle, Marek Tesar
Theoretical Computer Science
Top of PageReset Settings