1688 search results - page 98 / 338 » The Complexity of Rationalizing Matchings |
142
Voted
SPIRE
2010
Springer
15 years 3 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...
126
click to vote
ICIP
2009
IEEE
15 years 3 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...
144
click to vote
ICMCS
2009
IEEE
15 years 3 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...
132
Voted
MICCAI
2009
Springer
16 years 6 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...
151
Voted
STACS
2010
Springer
16 years 9 days 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 ...