Fast Prediction on a Tree

14 years 1 months ago

Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m

Mark Herbster, Massimiliano Pontil, Sergio Rojas G

Graph Laplacian | Information Technology | N-vertex Weighted Tree | NIPS 2008 | Spanning Tree |

claim paper

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	NIPS
Authors	Mark Herbster, Massimiliano Pontil, Sergio Rojas Galeano

Comments (0)