✦ LIBER ✦

Online algorithms for the multiple time series search problem

✍ Scribed by Wenming Zhang; Yinfeng Xu; Feifeng Zheng; Yucheng Dong

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal algorithms for the online time s

✍ Yinfeng Xu; Wenming Zhang; Feifeng Zheng 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Optimal algorithms for online time serie

✍ Wenming Zhang; Yinfeng Xu; Feifeng Zheng; Yucheng Dong 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 318 KB

Fast search algorithms for the n-queens

✍ Sosic, R.; Gu, J. 📂 Article 📅 1991 🏛 Institute of Electrical and Electronics Engineers ⚖ 566 KB

Heuristic algorithms for the multiple kn

✍ S. Martello; P. Toth 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 835 KB

Algorithms for the multiple label placem

✍ Konstantinos G. Kakoulis; Ioannis G. Tollis 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Online algorithms for searching and expl

✍ Subir Kumar Ghosh; Rolf Klein 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 453 KB