Results 211 to 220 of about 7,748 (260)
Some of the next articles are maybe not open access.
Journal of the ACM, 1980
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Ladner, Richard E., Fischer, Michael J.
openaire +1 more source
Summary: The prefix problem is to compute all the products \(x_1\circ x_2\circ \ldots x_k\) for \(i\leq k\leq n\), where \(\circ\) is an associative operation. A recursive construction is used to obtain a product circuit for solving the prefix problem which has depth exactly \([\log_2n]\) and size bounded by \(4n\).
Ladner, Richard E., Fischer, Michael J.
openaire +1 more source
2002
Abstract In the preceding chapters, the word-forming properties of head movement and phrasal movement have been the topic of discussion. What these movement operations have in common is that as a rule they give rise to suffixes. More precisely, if head movement or phrasal movement creates a complex word out of a lexical element and one ...
openaire +2 more sources
Abstract In the preceding chapters, the word-forming properties of head movement and phrasal movement have been the topic of discussion. What these movement operations have in common is that as a rule they give rise to suffixes. More precisely, if head movement or phrasal movement creates a complex word out of a lexical element and one ...
openaire +2 more sources
Proceedings of the tenth international conference on Information and knowledge management - CIKM'01, 2001
This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In our earlier work, we suggested an efficient method for whole matching under time warping.
Sanghyun Park +3 more
openaire +1 more source
This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In our earlier work, we suggested an efficient method for whole matching under time warping.
Sanghyun Park +3 more
openaire +1 more source
Prefixes repel stress in reading aloud: Evidence from surface dyslexia
Cortex, 2016Jeremy J Tree +2 more
exaly
The internal syntax of Shona class prefixes
Language Sciences, 2014Rose-Marie Dechaine, Martina Wiltschko
exaly
Efficient FIB caching using minimal non-overlapping prefixes
Computer Communication Review, 2013Lan Wang
exaly