3008 search results - page 135 / 602 » Independence in connected graphs |
161
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
184
click to vote
COMSWARE
2006
IEEE
16 years 14 days ago
2006
IEEE
— Development in new radio technologies and increase in user demands are driving the deployment of a wide array of wireless networks, ranging from 802.11 networks in the local ar...
177
click to vote
CEAS
2006
Springer
15 years 10 months ago
2006
Springer
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...
189
click to vote
RSA
2010
15 years 4 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
190
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...