3757 search results - page 7 / 752 » The overlap number of a graph |
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
DNA
2004
Springer
14 years 22 days ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
ACSC
2003
IEEE
14 years 20 days ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Background: Most cellular processes are carried out by multi-protein complexes, groups of proteins that bind together to perform a specific task. Some proteins form stable complex...