866 search results - page 68 / 174 » Algorithms for Comparing Pedigree Graphs |
AI
1998
Springer
13 years 10 months ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
ACSC
2003
IEEE
14 years 3 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
ESA
2007
Springer
14 years 2 months ago
2007
Springer
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
CVPR
2006
IEEE
15 years 8 days ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
DAC
2007
ACM
14 years 11 months ago
2007
ACM
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...