Fast and Optimal Prediction on a Labeled Tree
暂无分享,去创建一个
[1] Mark Herbster,et al. Online learning over graphs , 2005, ICML.
[2] Mark Herbster,et al. Prediction on a Graph with a Perceptron , 2006, NIPS.
[3] David Bruce Wilson,et al. Generating random spanning trees more quickly than the cover time , 1996, STOC '96.
[4] Nikhil Srivastava,et al. Graph sparsification by effective resistances , 2008, SIAM J. Comput..
[5] Krzysztof Onak,et al. Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[6] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.
[7] Bernhard Schölkopf,et al. Protein functional class prediction with a combined graph , 2003, Expert Syst. Appl..
[8] Guy Lever,et al. Online Prediction on Large Diameter Graphs , 2008, NIPS.
[9] Boonserm Kijsirikul,et al. Low congestion online routing and an improved mistake bound for online prediction of graph labeling , 2008, ArXiv.
[10] AvinChen,et al. Many random walks are faster than one , 2011 .
[11] Mark Herbster,et al. Fast Prediction on a Tree , 2008, NIPS.
[12] Andrei Z. Broder,et al. Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.
[13] Wan-Shiou Yang,et al. Discovering cohesive subgroups from social networks for targeted advertising , 2008, Expert Syst. Appl..
[14] Noga Alon,et al. Many random walks are faster than one , 2007, SPAA '08.
[15] Navin Goyal,et al. Expanders via random spanning trees , 2008, SODA.
[16] Chuan Yi Tang,et al. A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..
[17] Mark Herbster,et al. Exploiting Cluster-Structure to Predict the Labeling of a Graph , 2008, ALT.