231
click to vote
TCS
10 years 14 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...
141
click to vote
TCS
10 years 14 days ago
2016 
rder Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi 3D rectangulations and geometric matrix multiplication. Peter Floderus...
147
click to vote
TCS
10 years 14 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...
151
click to vote
TCS
10 years 14 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...
129
click to vote
TCS
10 years 14 days ago
2016
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...
|
Theoretical Computer Science