5473 search results - page 738 / 1095 » On the graph isomorphism problem |
150
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
The statistical pattern recognition is a promising framework for text-to-text translation. However, a natural extension to speech-input translation is not straightforward. In this...
157
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
195
click to vote
INFOVIS
1999
IEEE
15 years 11 months ago
1999
IEEE
A new method is presented to get insight into univariate time series data. The problem addressed here is how to identify patterns and trends on multiple time scales (days, weeks, ...
157
click to vote
ASAP
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
143
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...