1688 search results - page 98 / 338 » The Complexity of Rationalizing Matchings |
SPIRE
2010
Springer
13 years 8 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
ICIP
2009
IEEE
13 years 8 months ago
2009
IEEE
- In modern video coding standards, motion compensated prediction (MCP) plays a key role to achieve video compression efficiency. Most of them make use of block matching techniques...
ICMCS
2009
IEEE
13 years 8 months ago
2009
IEEE
- In modern video coding standards, motion compensated prediction (MCP) plays a key role to achieve video compression efficiency. Most of them make use of block matching techniques...
MICCAI
2009
Springer
14 years 11 months ago
2009
Springer
Recent advances in biophotonics have enabled in-vivo, in-situ histopathology for routine clinical applications. The non-invasive nature of these optical `biopsy' techniques, h...
STACS
2010
Springer
14 years 5 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 ...