866 search results - page 35 / 174 » Algorithms for Comparing Pedigree Graphs |
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper presents a general framework for agglomerative hierarchical clustering based on graphs. Specifying an inter-cluster similarity measure, a subgraph of the similarity gra...
COCOA
2007
Springer
14 years 3 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
SEFM
2008
IEEE
14 years 3 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
NIPS
2003
13 years 10 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
ICPP
1993
IEEE
14 years 1 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...