Sciweavers

1067 search results - page 14 / 214
» Probabilistic regular graphs
Sort
View
ECCV
2010
Springer
14 years 3 months ago
From a Set of Shapes to Object Discovery
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
MFCS
2007
Springer
14 years 5 months ago
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
William Duckworth, Michele Zito
RSA
2010
108views more  RSA 2010»
13 years 9 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
SEMWEB
2005
Springer
14 years 4 months ago
Representing Probabilistic Relations in RDF
Probabilistic inference will be of special importance when one needs to know how much we can say with what all we know given new observations. Bayesian Network is a graphical prob...
Yoshio Fukushige
ICML
2007
IEEE
14 years 11 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda