492 search results - page 19 / 99 » Perfect Matching Preservers |
110
click to vote
COCO
1998
Springer
15 years 4 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
DAC
2005
ACM
16 years 24 days ago
2005
ACM
A rational Arnoldi method for passivity-preserving model-order reduction (MOR) with implicit multi-point moment matching for systems with frequency-dependent interconnects is desc...
120
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Stereo matching commonly requires rectified images that
are computed from calibrated cameras. Since all under-
lying parametric camera models are only approximations,
calibratio...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
102
click to vote
ENTCS
2007
14 years 11 months ago
2007
We construct a language extension for process calculi for modelling the exchange of cryptographically composed data. More specifically, we devise a succinct syntax for terms and ...