Results 201 to 210 of about 44,211 (221)
Some of the next articles are maybe not open access.
Computing suffix links for suffix trees and arrays
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Recency and End-of-Sequence Suffix Effects Are Not Always Linked
The American Journal of Psychology, 1984Sensory trace theories have linked recency and end-of-sequence suffix effects. However, backward recall and other paradigms have shown recency and generalized suffix effects. In an effort to determine the necessary conditions for the large end-of-sequence suffix effect, an experiment was performed comparing recall of 7and 11-unit digit sequences ...
Susan Karp Manning, Jamie Seidman Turner
openaire +1 more source
Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators
2014Consider a constraint on a sequence of variables functionally determining a result variable that is unchanged under reversal of the sequence. Most such constraints have a compact encoding via an automaton augmented with accumulators, but it is unknown how to maintain domain consistency efficiently for most of them.
Beldiceanu, Nicolas +4 more
openaire +1 more source
Query Directed Web Page Clustering Using Suffix Tree and Wikipedia Links
2012Recent research on Web page clustering has shown that the user query plays a critical role in guiding the categorisation of web search results. This paper combines our Query Directed Clustering algorithm (QDC) with another existing algorithm, Suffix Tree Clustering (STC), to identify common phrases shared by documents for base cluster identification ...
John Park, Xiaoying Gao, Peter Andreae
openaire +1 more source
Linking Morphological Knowledge to English Decoding Ability: Large Effects of Little Suffixes
2003It has long been known that an awareness of how letters correspond to speech sounds (or phones) is crucial for a child to learn to read English (Adams, 1990; Bradley & Bryant, 1985; Liberman, 1982; Mann, 1998; Perfetti, 1985). This allows young decoders of the English orthography to gain the insight that strings of letters, like b-i-g and d-o-g, can be
Virginia Mann, Maria Singson
openaire +1 more source
Faster Suffix Tree Construction with Missing Suffix Links
SIAM Journal on Computing, 2003Ramesh Hariharan
exaly
A suffix tree or not a suffix tree?
Journal of Discrete Algorithms, 2015Tatiana Starikovskaya +1 more
exaly
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems, 2007Kunihiko Sadakane
exaly
A taxonomy of suffix array construction algorithms
ACM Computing Surveys, 2007Simon J Puglisi, W F Smyth
exaly