Titlebook: Sequences II; Methods in Communica Renato Capocelli,Alfredo Santis,Ugo Vaccaro Conference proceedings 1993 Springer-Verlag New York, Inc. 1

Flange

書(shū)目名稱Sequences II影響因子(影響力)




書(shū)目名稱Sequences II影響因子(影響力)學(xué)科排名




書(shū)目名稱Sequences II網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Sequences II網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Sequences II被引頻次




書(shū)目名稱Sequences II被引頻次學(xué)科排名




書(shū)目名稱Sequences II年度引用




書(shū)目名稱Sequences II年度引用學(xué)科排名




書(shū)目名稱Sequences II讀者反饋




書(shū)目名稱Sequences II讀者反饋學(xué)科排名

CHAFE

Detection of Skew in a Sequence of Subsets ..,...,..,..., where each .. is a codeword in . with its elements in any order and the receiver receives a sequence .′., .′.,..., .′.,..., where each .′. is equal to .. with perhaps some skew from the previous and following codewords. The idea is to decode correctly the codewords when there is no s

常到

Flagging

占卜者

Peristalsis

背景

Adaptive Lossless Data Compression over a Noisy Channelf dynamic communication is .. A potential drawback of dynamic communication is . (that causes the sender and receiver dictionaries to diverge and possibly corrupt all data to follow). Protocols that require the receiver to request re-transmission from the sender when an error is detected can be impr

Fillet,Filet

Parallel string matching algorithmsperform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we survey recent results on parallel algorithms for the string matching problem.

wreathe

Periodic Prefixes in Textsalil and Seiferas (called GS algorithm [GS 83]). The algorithm contains a parameter . that says how many times some prefixes repeat at the beginning of the text. The complexity of GS algorithm essentially depends on . and originally the GS algorithm works only for .≥4. We improve on the value of . a

遍及