3008 search results - page 123 / 602 » Independence in connected graphs |
134
click to vote
NIPS
2007
15 years 7 months ago
2007
It has been shown that adapting a dictionary of basis functions to the statistics of natural images so as to maximize sparsity in the coefficients results in a set of dictionary ...
164
click to vote
CAS
2008
15 years 6 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
187
click to vote
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
226
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
170
click to vote
GLOBECOM
2007
IEEE
16 years 22 days ago
2007
IEEE
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...