3008 search results - page 85 / 602 » Independence in connected graphs |
141
click to vote
APPML
2005
15 years 6 months ago
2005
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
190
click to vote
IPSN
2005
Springer
15 years 12 months ago
2005
Springer
— We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a si...
176
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
153
click to vote
UAI
2004
15 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
158
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be reg...