1664 search results - page 112 / 333 » Distance labeling in graphs |
125
click to vote
CORR
1999
Springer
15 years 4 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...
120
click to vote
ICDM
2008
IEEE
15 years 11 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 ...
144
click to vote
PKDD
2010
Springer
15 years 2 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...
145
click to vote
GECCO
2006
Springer
15 years 8 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...
156
click to vote
COMBINATORICS
2002
15 years 4 months ago
2002
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...