Sciweavers

41 search results - page 3 / 9
» Spectrum of Variable-Random Trees
Sort
View
ICPR
2006
IEEE
14 years 6 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
ECCV
2010
Springer
13 years 5 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
BIB
2007
158views more  BIB 2007»
13 years 4 months ago
Biodiversity informatics: organizing and linking information across the spectrum of life
Biological knowledge can be inferred from three major levels of information: molecules, organisms and ecologies. Bioinformatics is an established field that has made significant a...
Indra Neil Sarkar
SIAMDM
2008
99views more  SIAMDM 2008»
13 years 5 months ago
Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
Qunqiang Feng, Hosam M. Mahmoud, Alois Panholzer
RSA
2010
108views more  RSA 2010»
13 years 3 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge