187 search results - page 1 / 38 » On the Natural Imprint Function of a Graph |
EJC
2002
13 years 4 months ago
2002
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
BMCBI
2006
13 years 5 months ago
2006
Background: The imprint of natural selection on gene sequences is often difficult to detect. A plethora of methods have been devised to detect genetic changes due to selective pro...
ACL
2003
13 years 6 months ago
2003
This paper proposes the “Hierarchical Directed Acyclic Graph (HDAG) Kernel” for structured natural language data. The HDAG Kernel directly accepts several levels of both chunk...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...