TCS 2016 - PDF Preprint Papers

TCS 2016 International Conference on Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCS-2016 Paper

click to vote

TCS
2016

83views Theoretical Computer Science» more TCS 2016»

Adaptive metric dimensionality reduction

8 years 7 months ago

Download www.wisdom.weizmann.ac.il

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...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	83	Adaptive metric dimensionality reduction	claim
2	73	Average-case complexity of the min-sum matrix product problem	claim
3	65	On 2-protected nodes in random digital trees	claim
4	65	Computing maximal cliques in link streams	claim
5	59	Computational complexity of covering three-vertex multigraphs	claim
6	56	On competitive recommendations	claim
7	54	Fast factorization of Cartesian products of (directed) hypergraphs	claim
8	54	Changing of the guards: Strip cover with duty cycling	claim
9	54	Hardness of computing width parameters based on branch decompositions over the vertex set	claim
10	52	The number and degree distribution of spanning trees in the Tower of Hanoi graph	claim
11	51	Order compression schemes	claim
12	50	Card-based protocols for securely computing the conjunction of multiple variables	claim
13	48	Games on interval and permutation graph representations	claim
14	48	Unique parallel decomposition in branching and weak bisimulation semantics	claim
15	48	Capacitated Max-Batching with interval graph compatibilities	claim
16	47	A synthetic axiomatization of Map Theory	claim
17	46	Load rebalancing games in dynamic systems with migration costs	claim
18	45	Exact algorithms for weighted and unweighted Borda manipulation problems	claim
19	43	A calculus and logic of bunched resources and processes	claim
20	42	Convex p-partitions of bipartite graphs	claim
21	39	Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3	claim
22	38	Gray coding cubic planar maps	claim
23	38	On the state complexity of closures and interiors of regular languages with subwords and superwords	claim
24	36	Minimizing average flow-time under knapsack constraint	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers