2031 search results - page 62 / 407 » On Tree-Constrained Matchings and Generalizations |
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at l...
119
click to vote
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Stereo matching has been one of the most active areas in computer vision for decades. Many methods, ranging from similarity measures to local or global matching cost optimization ...
104
click to vote
CVPR
2000
IEEE
15 years 2 months ago
2000
IEEE
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...
STACS
2010
Springer
15 years 4 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 ...