4009 search results - page 695 / 802 » Clustering on Complex Graphs |
154
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
154
click to vote
DAM
2008
15 years 4 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
157
click to vote
ALMOB
2006
15 years 4 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
134
click to vote
EOR
2008
15 years 4 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
179
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...