JMLR: Workshop and Conference Proceedings vol 40:1–20, 2015 S2 : An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification Gautam Dasarathy

First Page		Document Content
Date: 2015-07-20 20:08:36 Graph connectivity Graph theory Edsger W. Dijkstra Network theory Shortest path problem Bridge Connected component Connectivity Graph Routing algorithms Planar separator theorem Minimum spanning tree		JMLR: Workshop and Conference Proceedings vol 40:1–20, 2015 S2 : An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification Gautam Dasarathy Add to Reading List Source URL: jmlr.org Download Document from Source Website File Size: 838,94 KB Share Document on Facebook

	The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree V´ıt Jel´ınek1 , Eva Jel´ınkov´a1 , Jan Kratochv´ıl12 , Bernard Lidick´ y1 , Marek Tesaˇr1 , Tom´aˇs 12 Vyskoˇcil DocID: 1rnTu - View Document
	Reorder.js: A JavaScript Library to Reorder Tables and Networks Jean-Daniel Fekete To cite this version: Jean-Daniel Fekete. Reorder.js: A JavaScript Library to Reorder Tables and Networks. IEEE DocID: 1riP1 - View Document
	Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory DocID: 1rcqn - View Document
	A brief summary of the work of Fan Chung 1. Extremal graph theory • Universal graphs The general problem of interest is: “What is the smallest graph which contains as subgraphs (or induced subgraphs) all members of a DocID: 1ra7T - View Document
	Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p DocID: 1r43q - View Document