Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Masashi Kiyomi, Takashi Horiyama, Yota Otachi |
Longest Common Subsequence in Sublinear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.08588, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer |
The Edit Distance to k-Subsequence Universality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.09192, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Taejun Kim, Minsuk Choi, Evan Sacks, Yi-Hsuan Yang, Juhan Nam |
A Computational Analysis of Real-World DJ Mixes using Mix-To-Track Subsequence Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.10267, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Michele Linardi, Themis Palpanas |
Scalable Data Series Subsequence Matching with ULISSE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.10373, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Sachin Pawar, Pushpak Bhattacharyya, Girish K. Palshikar |
Extracting N-ary Cross-sentence Relations using Constrained Subsequence Kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.08185, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Ethan Jacob Moyer, Anup Das 0001 |
Machine learning applications to DNA subsequence and restriction site analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.03544, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.06796, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Benjamin Eyre, Aparna Balagopalan, Jekaterina Novikova |
Fantastic Features and Where to Find Them: Detecting Cognitive Impairment with a Subsequence Classification Guided Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.06579, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Anadi Agrawal, Pawel Gawrychowski |
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.13589, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Paul Boniol, Themis Palpanas, Mohammed Meftah, Emmanuel Remy |
GraphAn: Graph-based Subsequence Anomaly Detection. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. VLDB Endow. ![In: Proc. VLDB Endow. 13(12), pp. 2941-2944, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Paul Boniol, Themis Palpanas |
Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. VLDB Endow. ![In: Proc. VLDB Endow. 13(11), pp. 1821-1834, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Abdulrhman Aljouie, Ling Zhong, Usman Roshan |
High scoring segment selection for pairwise whole genome sequence alignment with the maximum scoring subsequence and GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Biol. Drug Des. ![In: Int. J. Comput. Biol. Drug Des. 13(1), pp. 71-81, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Jagannath Bhanja, Ram Krishna Pandey |
Inverse problems for certain subsequence sums in integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(12), pp. 112148, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Sen-Peng Eu, Tung-Shan Fu, Hsiang-Chun Hsu, Hsin-Chieh Liao, Wei-Liang Sun |
Signed mahonian identities on permutations with subsequence restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 170, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Michele Linardi, Themis Palpanas |
Scalable data series subsequence matching with ULISSE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 29(6), pp. 1449-1474, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Yoshifumi Sakai, Shunsuke Inenaga |
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 6:1-6:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Anadi Agrawal, Pawel Gawrychowski |
A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 4:1-4:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Anni Jia, Wei Yang, Gongxuan Zhang |
Side Channel Leakage Alignment Based on Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BigDataSE ![In: 14th IEEE International Conference on Big Data Science and Engineering, BigDataSE 2020, Guangzhou, China, December 31, 2020 - January 1, 2021, pp. 130-137, 2020, IEEE, 978-0-7381-1114-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Aviad Rubinstein, Zhao Song 0002 |
Reducing approximate Longest Common Subsequence to approximate Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 1591-1600, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Paul Boniol, Michele Linardi, Federico Roncallo, Themis Palpanas |
SAD: An Unsupervised System for Subsequence Anomaly Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 36th IEEE International Conference on Data Engineering, ICDE 2020, Dallas, TX, USA, April 20-24, 2020, pp. 1778-1781, 2020, IEEE, 978-1-7281-2903-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Noura Alghamdi, Liang Zhang, Huayi Zhang, Elke A. Rundensteiner, Mohamed Y. Eltabakh |
ChainLink: Indexing Big Time Series Data For Long Subsequence Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 36th IEEE International Conference on Data Engineering, ICDE 2020, Dallas, TX, USA, April 20-24, 2020, pp. 529-540, 2020, IEEE, 978-1-7281-2903-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Benjamin Eyre, Aparna Balagopalan, Jekaterina Novikova |
Fantastic Features and Where to Find Them: Detecting Cognitive Impairment with a Subsequence Classification Guided Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
W-NUT@EMNLP ![In: Proceedings of the Sixth Workshop on Noisy User-generated Text, W-NUT@EMNLP 2020 Online, November 19, 2020, pp. 193-199, 2020, Association for Computational Linguistics, 978-1-952148-76-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 12:1-12:11, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Evangelos Kipouridis, Kostas Tsichlas |
Longest Common Subsequence on Weighted Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark., pp. 19:1-19:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-149-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Yungang Pan, Ke Liu, Zhaoyan Shen, Xiaojun Cai, Zhiping Jia |
Sequence-To-Subsequence Learning With Conditional Gan For Power Disaggregation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICASSP ![In: 2020 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2020, Barcelona, Spain, May 4-8, 2020, pp. 3202-3206, 2020, IEEE, 978-1-5090-6631-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Taejun Kim, Minsuk Choi, Evan Sacks, Yi-Hsuan Yang, Juhan Nam |
A Computational Analysis of Real-World DJ Mixes using Mix-To-Track Subsequence Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIR ![In: Proceedings of the 21th International Society for Music Information Retrieval Conference, ISMIR 2020, Montreal, Canada, October 11-16, 2020, pp. 764-770, 2020, 978-0-9813537-1-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Wang Xuan, Ziyang Chen, Lusha Zhai |
An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NLPIR ![In: NLPIR 2020: 4th International Conference on Natural Language Processing and Information Retrieval, Seoul, Republic of Korea, December 18-20, 2020, pp. 200-204, 2020, ACM, 978-1-4503-7760-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Fan Meng |
Aiming at real applications: Subsequence Outlier Detection on Mixed-Type Attributes Data in RDBMS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDR ![In: 10th Conference on Innovative Data Systems Research, CIDR 2020, Amsterdam, The Netherlands, January 12-15, 2020, Online Proceedings, 2020, www.cidrdb.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Dilip Singh Sisodia, Inakollu NehaPriyanka, Prodduturi Amulya |
Longest Common Subsequence based Multistage Collaborative Filtering for Recommender Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIT ![In: 21st International Arab Conference on Information Technology, ACIT 2020, Giza, Egypt, November 28-30, 2020, pp. 1-5, 2020, IEEE, 978-1-7281-8855-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Lech Duraj |
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 41:1-41:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum 0001 |
On Solving a Generalized Constrained Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPTIMA ![In: Optimization and Applications - 11th International Conference, OPTIMA 2020, Moscow, Russia, September 28 - October 2, 2020, Proceedings, pp. 55-70, 2020, Springer, 978-3-030-62866-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Alexander V. Gnedin, Amirlan Seksenbayev |
Diffusion Limits in the Online Subsequence Selection Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AofA ![In: 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference)., pp. 14:1-14:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-147-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Masaki Ono, Takayuki Katsuki, Masaki Makino, Kyoichi Haida, Atsushi Suzuki |
Interpretation Method for Continuous Glucose Monitoring with Subsequence Time-Series Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MIE ![In: Digital Personalized Health and Medicine - Proceedings of MIE 2020, Medical Informatics Europe, Geneva, Switzerland, April 28 - May 1, 2020., pp. 277-281, 2020, IOS Press, 978-1-64368-082-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai |
Longest Square Subsequence Problem Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Orlando, FL, USA, October 13-15, 2020, Proceedings, pp. 147-154, 2020, Springer, 978-3-030-59211-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, Gunnar W. Klau |
The Longest Run Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: 20th International Workshop on Algorithms in Bioinformatics, WABI 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 6:1-6:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-161-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Kangzhi Zhao, Yong Zhang 0002, Hongzhi Yin, Jin Wang 0007, Kai Zheng 0001, Xiaofang Zhou 0001, Chunxiao Xing |
Discovering Subsequence Patterns for Next POI Recommendation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 3216-3222, 2020, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu |
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 7:1-7:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-172-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Paul Boniol |
Unsupervised Subsequence Anomaly Detection in Large Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PhD@VLDB ![In: Proceedings of the VLDB 2020 PhD Workshop co-located with the 46th International Conference on Very Large Databases (VLDB 2020), ONLINE, August 31 - September 4, 2020., 2020, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Xueyuan Gong, Simon Fong 0001, Yain-Whar Si |
Fast fuzzy subsequence matching algorithms on time-series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 116, pp. 275-284, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Takuto Sakuma, Kazuya Nishi, Kaoru Kishimoto, Kazuya Nakagawa, Masayuki Karasuyama, Yuta Umezu, Shinsuke Kajioka, Shuhei J. Yamazaki, Koutarou D. Kimura, Sakiko Matsumoto, Ken Yoda, Matasaburo Fukutomi, Hisashi Shidara, Hiroto Ogawa, Ichiro Takeuchi |
Efficient learning algorithm for sparse subsequence pattern-based classification and applications to comparative animal trajectory data analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Robotics ![In: Adv. Robotics 33(3-4), pp. 134-152, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Lech Duraj, Marvin Künnemann, Adam Polak 0001 |
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 81(10), pp. 3968-3992, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Kelin Luo, Yinfeng Xu, Huili Zhang |
On-line scheduling with monotone subsequence constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 786, pp. 13-25, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Yoshifumi Sakai |
Maximal common subsequence algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 793, pp. 132-139, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
Comparing incomplete sequences via longest common subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 796, pp. 272-285, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Jiawei Gao 0001 |
On the Fine-grained Complexity of Least Weight Subsequence in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Antonio Candelieri, Stanislav Fedorov, Vincenzina Messina |
Efficient Kernel-based Subsequence Search for User Identification from Walking Activity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.04680, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Lech Duraj |
A sub-quadratic algorithm for the longest common increasing subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.06864, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Chunkai Zhang, Yingyang Chen, Ao Yin |
Anomaly Subsequence Detection with Dynamic Local Density for Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.00701, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Joakim Blikstad |
On the longest common subsequence of Thue-Morse words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.00248, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Aviad Rubinstein, Zhao Song 0002 |
Reducing approximate Longest Common Subsequence to approximate Edit Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.05451, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Evangelos Kipouridis, Kostas Tsichlas |
Longest Common Subsequence on Weighted Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.04068, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Radu Stefan Mincu, Alexandru Popa 0001 |
Heuristic algorithms for the Longest Filled Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.07902, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Md. Rafiqul Islam 0002, C. M. Khaled Saifullah, Zarrin Tasnim Asha, Rezoana Ahamed |
Chemical reaction optimization for solving longest common subsequence problem for multiple string. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 23(14), pp. 5485-5509, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Qin Zhang 0011, Jia Wu 0001, Peng Zhang 0001, Guodong Long, Chengqi Zhang |
Salient Subsequence Learning for Time Series Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 41(9), pp. 2193-2207, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Ronghui Wu, Qing Li, Xiangtao Chen |
Mining contrast sequential pattern based on subsequence time distribution variation with discreteness constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 49(12), pp. 4348-4360, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Danila Piatov, Sven Helmer, Anton Dignös, Johann Gamper |
Interactive and space-efficient multi-dimensional time series subsequence matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Syst. ![In: Inf. Syst. 82, pp. 121-135, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Antonio Candelieri, Stanislav Fedorov, Enza Messina |
Efficient Kernel-Based Subsequence Search for Enabling Health Monitoring Services in IoT-Based Home Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sensors ![In: Sensors 19(23), pp. 5192, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Youxi Wu, Yuehua Wang, Jingyu Liu 0003, Ming Yu 0001, Jing Liu, Yan Li 0087 |
Mining distinguishing subsequence patterns with nonoverlapping condition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Clust. Comput. ![In: Clust. Comput. 22(Supplement), pp. 5905-5917, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Kaustubh Beedkar, Rainer Gemulla, Wim Martens |
A Unified Framework for Frequent Sequence Mining with Subsequence Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 44(3), pp. 11:1-11:42, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Christian Bock, Matteo Togninalli, M. Elisabetta Ghisu, Thomas Gumbsch, Bastian Rieck, Karsten M. Borgwardt |
A Wasserstein Subsequence Kernel for Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: 2019 IEEE International Conference on Data Mining, ICDM 2019, Beijing, China, November 8-11, 2019, pp. 964-969, 2019, IEEE, 978-1-7281-4604-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | MohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun |
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 1654-1672, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Alexander Renz-Wieland, Matthias Bertsch, Rainer Gemulla |
Scalable Frequent Sequence Mining with Flexible Subsequence Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019, pp. 1490-1501, 2019, IEEE, 978-1-5386-7474-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Jiaye Wu, Peng Wang 0027, Ningting Pan, Chen Wang 0018, Wei Wang 0009, Jianmin Wang 0001 |
KV-Match: A Subsequence Matching Approach Supporting Normalization and Time Warping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019, pp. 866-877, 2019, IEEE, 978-1-5386-7474-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Marko Djukanovic, Günther R. Raidl, Christian Blum 0001 |
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOD ![In: Machine Learning, Optimization, and Data Science - 5th International Conference, LOD 2019, Siena, Italy, September 10-13, 2019, Proceedings, pp. 154-167, 2019, Springer, 978-3-030-37598-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Qing Li, Xiangtao Chen, Ronghui Wu |
Mining Contrast Sequential Patterns based on Subsequence Location Distribution from Biological Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSIT ![In: Proceedings of the 2nd International Conference on Data Science and Information Technology, DSIT 2019, Seoul, South Korea, July 19-21, 2019, pp. 204-209, 2019, ACM, 978-1-4503-7141-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Chunkai Zhang, Yingyang Chen, Ao Yin |
Anomaly Subsequence Detection with Dynamic Local Density for Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA (2) ![In: Database and Expert Systems Applications - 30th International Conference, DEXA 2019, Linz, Austria, August 26-29, 2019, Proceedings, Part II, pp. 291-305, 2019, Springer, 978-3-030-27617-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Jiafeng Ding, Junhua Fang, Zonglei Zhang, Pengpeng Zhao, Jiajie Xu 0001, Lei Zhao 0001 |
Real-Time Trajectory Similarity Processing Using Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC/SmartCity/DSS ![In: 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019, Zhangjiajie, China, August 10-12, 2019, pp. 1398-1405, 2019, IEEE, 978-1-7281-2058-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Zekun Yin, Hao Zhang, Kai Xu, Yuandong Chan, Shaoliang Peng, Xiaoning Wang, Bertil Schmidt, Weiguo Liu |
XLCS: A New Bit-Parallel Longest Common Subsequence Algorithm on Xeon Phi Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC/SmartCity/DSS ![In: 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2019, Zhangjiajie, China, August 10-12, 2019, pp. 1477-1483, 2019, IEEE, 978-1-7281-2058-4. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Shoumik Roychoudhury, Fang Zhou, Zoran Obradovic |
Leveraging Subsequence-orders for Univariate and Multivariate Time-series Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SDM ![In: Proceedings of the 2019 SIAM International Conference on Data Mining, SDM 2019, Calgary, Alberta, Canada, May 2-4, 2019., pp. 495-503, 2019, SIAM, 978-1-61197-567-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Kefeng Feng, Jiaye Wu, Peng Wang 0027, Ningting Pan, Wei Wang 0009 |
MVS-match: An Efficient Subsequence Matching Approach Based on the Series Synopsis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA (3) ![In: Database Systems for Advanced Applications - 24th International Conference, DASFAA 2019, Chiang Mai, Thailand, April 22-25, 2019, Proceedings, Part III, and DASFAA 2019 International Workshops: BDMS, BDQM, and GDMA, Chiang Mai, Thailand, April 22-25, 2019, Proceedings, pp. 368-372, 2019, Springer, 978-3-030-18589-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Ramoza Ahsan, Muzammil Bashir, Rodica Neamtu, Elke A. Rundensteiner, Gábor N. Sárközy |
Nearest Neighbor Subsequence Search in Time Series Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE BigData ![In: 2019 IEEE International Conference on Big Data (IEEE BigData), Los Angeles, CA, USA, December 9-12, 2019, pp. 2057-2066, 2019, IEEE, 978-1-7281-0858-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Marko Djukanovic, Günther R. Raidl, Christian Blum 0001 |
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST (1) ![In: Computer Aided Systems Theory - EUROCAST 2019 - 17th International Conference, Las Palmas de Gran Canaria, Spain, February 17-22, 2019, Revised Selected Papers, Part I, pp. 429-437, 2019, Springer, 978-3-030-45092-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Yuichi Asahiro, Jesper Jansson 0001, Guohui Lin, Eiji Miyano, Hirotaka Ono 0001, Tadatoshi Utashima |
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings, pp. 1-12, 2019, Springer, 978-3-030-36411-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Jiawei Gao 0001 |
On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany., pp. 16:1-16:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-129-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Michele Linardi |
Variable-length similarity search for very large data series: subsequence matching, motif and discord detection. (Recherche de similarité de longueur variable pour l'analyse de grandes séries temporelles: appariement de séquences, recherche de motifs et anomalies). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
15 | Paul R. McWhirter, Kashif Kifayat, Qi Shi 0001, Bob Askwith |
SQL Injection Attack classification through the feature extraction of SQL query strings using a Gap-Weighted String Subsequence Kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Secur. Appl. ![In: J. Inf. Secur. Appl. 40, pp. 199-216, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Prodromos Tsinaslanidis |
Subsequence dynamic time warping for charting: Bullish and bearish class predictions for NYSE stocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 94, pp. 193-204, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Shunsuke Inenaga, Heikki Hyyrö |
A hardness result and new algorithm for the longest common palindromic subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 129, pp. 11-15, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Adam Polak 0001 |
Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 132, pp. 1-5, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi |
Efficient geometric-based computation of the string subsequence kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 32(2), pp. 532-559, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Xueyuan Gong, Simon Fong 0001, Yain-Whar Si |
Fast multi-subsequence monitoring on streaming time-series based on Forward-propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 450, pp. 73-88, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Sang Won Bae, Inbok Lee |
On finding a longest common palindromic subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 710, pp. 29-34, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Kuo-Tsung Tseng, De-Sheng Chan, Chang-Biau Yang, Shou-Fu Lo |
Efficient merged longest common subsequence algorithms for similar sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 708, pp. 75-90, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Feddy Setio Pribadi, Adhistya Erna Permanasari, Teguh Bharata Adji |
Short answer scoring system using automatic reference answer generation and geometric average normalized-longest common subsequence (GAN-LCS). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Educ. Inf. Technol. ![In: Educ. Inf. Technol. 23(6), pp. 2855-2866, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Youhuan Li, Lei Zou 0001, Huaming Zhang, Dongyan Zhao 0001 |
Longest Increasing Subsequence Computation over Streaming Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 30(6), pp. 1036-1049, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen |
Non-Overlapping Subsequence Matching of Stream Synopses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 30(1), pp. 101-114, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Yana Kraeva, Mikhail L. Zymbler |
The Use of MPI and OpenMP Technologies for Subsequence Similarity Search in Very Large Time Series on Computer Cluster System with Nodes Based on the Intel Xeon Phi Knights Landing Many-core Processor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.10302, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Karl Bringmann, Marvin Künnemann |
Multivariate Fine-Grained Complexity of Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.00938, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Barbara Geissmann |
Longest Increasing Subsequence under Persistent Comparison Errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.03307, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Dev Goyal, Zeeshan Syed, Jenna Wiens |
Clinically Meaningful Comparisons Over Time: An Approach to Measuring Patient Similarity based on Subsequence Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.00744, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Thach Le Nguyen, Severin Gsponer, Iulia Ilie, Georgiana Ifrim |
Interpretable Time Series Classification using All-Subsequence Learning and Symbolic Representations in Time and Frequency Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.04022, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Christian Blum 0001, Maria J. Blesa |
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 62, pp. 15-28, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Christian Blum 0001, Maria J. Blesa |
A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 24(3), pp. 551-579, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Alessandro Arlotto, Yehua Wei, Xinchang Xie |
An adaptive O(log n)-optimal policy for the online selection of a monotone subsequence from a random sample. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 52(1), pp. 41-53, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Huiqing Wang, Chun Li, Hongwei Sun, Zhirong Guo, Yingying Bai |
Shapelet Classification Algorithm Based on Efficient Subsequence Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Sci. J. ![In: Data Sci. J. 17, pp. 6, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Zhanbing Wang, Wei Song 0006, Zhiyong Peng, Xiandi Yang, Yihui Cui, Yuan Shen 0005 |
一种面向密文基因数据的子序列外包查询方法 (Subsequence Outsourcing Query Method over Encrypted Genomic Data). ![Search on Bibsonomy](Pics/bibsonomy.png) |
计算机科学 ![In: 计算机科学 45(6), pp. 51-56, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | David J. Grynkiewicz |
Iterated sumsets and subsequence sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 160, pp. 136-167, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Alejandro Bellogín, Pablo Sánchez 0001 |
Applying Subsequence Matching to Collaborative Filtering: Extended Abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CERI ![In: Proceedings of the 5th Spanish Conference on Information Retrieval, CERI 2018, Zaragoza, Spain, June 26-27, 2018, pp. 5:1-5:2, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Karl Bringmann, Marvin Künnemann |
Multivariate Fine-Grained Complexity of Longest Common Subsequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 1216-1235, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman 0001 |
On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings, pp. 207-215, 2018, Springer, 978-3-319-75171-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|