657 search results - page 18 / 132 » Implementing Matching in ALE--First Results |
133
click to vote
STACS
2010
Springer
15 years 10 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 ...
104
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
196
click to vote
WACV
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, stereo matching and 3D visualization issues are studied for a linear pushbroom stereo model built for 3D gamma-ray (or x-ray) cargo inspection. A fast and automated...
128
Voted
PVM
2007
Springer
15 years 9 months ago
2007
Springer
Open MPI was initially designed to support a wide variety of high-performance networks and network programming interfaces. Recently, Open MPI was enhanced to support networks that ...
120
Voted
OTM
2005
Springer
15 years 8 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...