1736 search results - page 196 / 348 » On antimagic directed graphs |
168
click to vote
DAM
2010
15 years 6 months ago
2010
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates...
203
click to vote
JMLR
2006
15 years 6 months ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
199
click to vote
FUIN
2007
15 years 6 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
204
click to vote
PAAPP
2000
15 years 6 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
176
click to vote
PR
2007
15 years 6 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...