6045 search results - page 261 / 1209 » Computable Linearizations of Well-partial-orderings |
254
click to vote
BANFF
1995
15 years 10 months ago
1995
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
189
click to vote
ISAAC
1997
Springer
15 years 11 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
313
click to vote
Source Code
A great flexible easy to use C++ library that is intended for scientists and engineers. The library supports the following matrix types: Matrix (rectangular matrix), UpperTriangula...
202
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or...
184
click to vote
ISBI
2008
IEEE
16 years 8 months ago
2008
IEEE
Here we present a scalable method to compute the structure of causal links over large scale dynamical systems that achieves high efficiency in discovering actual functional connec...