Active Exploration in Networks: Using Probabilistic Relationships for Learning and Inference Joseph J. Pfeiffer III1 , Jennifer Neville1 , Paul N. Bennett2 1 Purdue University, 2 Microsoft Research

First Page		Document Content
Date: 2015-01-17 04:41:51 Theoretical computer science Estimation theory Expectation–maximization algorithm Missing data Graph Mathematics Statistics Graph theory		Active Exploration in Networks: Using Probabilistic Relationships for Learning and Inference Joseph J. Pfeiffer III1 , Jennifer Neville1 , Paul N. Bennett2 1 Purdue University, 2 Microsoft Research Add to Reading List Source URL: research.microsoft.com Download Document from Source Website File Size: 1,67 MB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document