|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 12 keywords
|
|
|
|
|
Results
Found 3 publication records. Showing 3 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Yujiun P. Wang, Theodosios Pavlidis |
Optimal Correspondence of String Subsequences.  |
IEEE Trans. Pattern Anal. Mach. Intell.  |
1990 |
DBLP DOI BibTeX RDF |
string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar |
| 1 | Daniel S. Hirschberg |
Bounds on the Number of String Subsequences. |
CPM |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Mi Lu, Hua Lin |
Parallel Algorithms for the Longest Common Subsequence Problem. |
IEEE Trans. Parallel Distrib. Syst. |
1994 |
DBLP DOI BibTeX RDF |
longest common subsequence problem, string subsequences, symbol deletion, decision tree model, CREW-PRAM model, concurrent-read exclusive-write parallel random-access machine, grid directed graph, maximum-cost path, totally monotone array, parallel algorithms, parallel algorithms, computational complexity, directed graphs, complexity bound |
Displaying result #1 - #3 of 3 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")