1729 search results - page 244 / 346 » Bound Graph Polysemy |
150
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
150
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
138
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
165
click to vote
NIPS
2001
15 years 7 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
173
click to vote
CCCG
1998
15 years 7 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...