范例 发表于 2025-3-23 10:26:43

https://doi.org/10.1007/978-3-030-66234-9heeler transform (BWT), which is the basis of many state-of-the-art general purpose compressors applies a compression algorithm to a permuted version of the original text. List update algorithms are a common choice for this second stage of BWT-based compression. In this paper we perform an experimen

Armory 发表于 2025-3-23 15:56:21

Helen Peterson,Birgitta Jordanssonay of the trains into account. Typically, this can be a very laborious task involving detailed simulations. We propose to predict the risk of a planned train using a series of linear regression models on the basis of extensive real world delay data of trains. We show how to integrate these models in

Increment 发表于 2025-3-23 21:49:01

Anders Breidlid,Halldis Breidlidular index can be used to solve many problems in sequence analysis. In practice, one limitation of this data structure is its size of . log. bits, while the size of the text is . log|.| bits. For this reason compressed suffix arrays (CSAs) were introduced. The size of these CSAs is asymptotically le

彻底明白 发表于 2025-3-24 01:54:13

http://reply.papertrans.cn/32/3188/318797/318797_14.png

Absenteeism 发表于 2025-3-24 05:28:10

http://reply.papertrans.cn/32/3188/318797/318797_15.png

打算 发表于 2025-3-24 08:48:15

http://reply.papertrans.cn/32/3188/318797/318797_16.png

diskitis 发表于 2025-3-24 14:31:53

http://reply.papertrans.cn/32/3188/318797/318797_17.png

有发明天才 发表于 2025-3-24 15:04:31

http://reply.papertrans.cn/32/3188/318797/318797_18.png

Gratulate 发表于 2025-3-24 22:00:53

http://reply.papertrans.cn/32/3188/318797/318797_19.png

Chemotherapy 发表于 2025-3-25 02:23:46

Hannelore Güntner,Sabine WieningerWhat does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.
页: 1 [2] 3 4 5 6 7
查看完整版本: Titlebook: Experimental Algorithms; 8th International Sy Jan Vahrenhold Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 algorithm.a