370 search results - page 59 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
CSB
2003
IEEE
15 years 5 months ago
2003
IEEE
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
STOC
2009
ACM
16 years 7 days ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
100
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
ICML
2008
IEEE
16 years 13 days ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...