2294 search results - page 101 / 459 » From Path Graphs to Directed Path Graphs |
125
Voted
ECML
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...
124
click to vote
NOSSDAV
2001
Springer
15 years 7 months ago
2001
Springer
Recent advancements in video and audio codec technologies (e.g., RealVideo [18]) make multimedia streaming possible across a wide range of network conditions. With an increasing t...
147
click to vote
BIBE
2007
IEEE
15 years 9 months ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...
116
click to vote
DM
2008
15 years 2 months ago
2008
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
147
click to vote
COMBINATORICS
1999
15 years 2 months ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt