2286 search results - page 181 / 458 » Algorithms for Categorical Equivalence |
215
click to vote
TVCG
2012
13 years 9 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
165
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
172
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
165
click to vote
ACSD
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...
162
click to vote
QSIC
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in...