1605 search results - page 137 / 321 » On Partitional Labelings of Graphs |
CORR
1999
Springer
13 years 10 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
PKDD
2010
Springer
13 years 8 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...
ISCI
2007
13 years 10 months ago
2007
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...