4913 search results - page 286 / 983 » Results and Perspectives of the G |
178
click to vote
DAM
2010
15 years 6 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
186
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Ensembles of regular low-density parity-check codes over any finite Abelian group G are studied. The nonzero entries of the parity matrix are randomly chosen, independently and uni...
134
click to vote
JAT
2007
15 years 6 months ago
2007
Let A ⊂ L2(R) be at most countable, and p, q ∈ N. We characterize various frame-properties for Gabor systems of the form G(1, p/q,A) = {e2 imxg(x − np/q) : m, n ∈ Z, g ∈...
169
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Detection of sequence homologues represents a challenging task that is important for the discovery of protein families and the reliable application of automatic annota...
191
click to vote
JCT
2007
15 years 6 months ago
2007
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...