Search results for "subsequence"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Orestis Kostakis, Aristides Gionis	Subsequence Search in Event-Interval Sequences.	SIGIR	2015	DBLP DOI BibTeX RDF
15	David Markvica, Christian Schauer, Günther R. Raidl	CPU Versus GPU Parallelization of an Ant Colony Optimization for the Longest Common Subsequence Problem.	EUROCAST	2015	DBLP DOI BibTeX RDF
15	Mikhail L. Zymbler	Best-Match Time Series Subsequence Search on the Intel Many Integrated Core Architecture.	ADBIS	2015	DBLP DOI BibTeX RDF
15	Kosuke Sugano, Yu Fang, Kenta Oku, Kyoji Kawagoe	A coarse-to-fine method for subsequence matching of human behavior using multi-dimensional time-series approximation.	iiWAS	2015	DBLP DOI BibTeX RDF
15	Aleksander Movchan, Mikhail L. Zymbler	Time Series Subsequence Similarity Search Under Dynamic Time Warping Distance on the Intel Many-core Accelerators.	SISAP	2015	DBLP DOI BibTeX RDF
15	Luca Bonomi, Li Xiong 0001	Private Computation of the Longest Increasing Subsequence in Data Streams.	EDBT/ICDT Workshops	2015	DBLP BibTeX RDF
15	Myeong-Seon Gil, Bum-Soo Kim, Mi-Jung Choi, Yang-Sae Moon	Fast index construction for distortion-free subsequence matching in time-series databases.	BigComp	2015	DBLP DOI BibTeX RDF
15	Christian Hundt 0002	Efficient subsequence alignment of time series.		2015	RDF
15	Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman	Computing a Longest Common Palindromic Subsequence.	Fundam. Informaticae	2014	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz, Szymon Grabowski	Efficient algorithms for the longest common subsequence in k-length substrings.	Inf. Process. Lett.	2014	DBLP DOI BibTeX RDF
15	Tomasz Górecki	Using derivatives in a longest common subsequence dissimilarity measure for time series classification.	Pattern Recognit. Lett.	2014	DBLP DOI BibTeX RDF
15	Wei-Qiang Zhang 0001, Wei-Wei Liu 0001, Zhiyi Li, Yongzhe Shi, Jia Liu 0001	Spoken language recognition based on gap-weighted subsequence kernels.	Speech Commun.	2014	DBLP DOI BibTeX RDF
15	Jiaoyun Yang, Yun Xu, Yi Shang, Guoliang Chen 0001	A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.	IEEE Trans. Knowl. Data Eng.	2014	DBLP DOI BibTeX RDF
15	Chih-Yi Chiu, Tsung-Han Tsai, Yu-Cyuan Liou, Guei-Wun Han, Hung-Shuo Chang	Near-Duplicate Subsequence Matching Between the Continuous Stream and Large Video Dataset.	IEEE Trans. Multim.	2014	DBLP DOI BibTeX RDF
15	Anatoly Rodionov	Path algebra algorithm for finding longest increasing subsequence.	CoRR	2014	DBLP BibTeX RDF
15	Gary Benson, Avivit Levy, B. Riva Shalom	Longest Common Subsequence in k-length substrings.	CoRR	2014	DBLP BibTeX RDF
15	Philip Bille, Patrick Hagge Cording, Inge Li Gørtz	Compact Subsequence Matching and Packed Tree Coloring.	CoRR	2014	DBLP BibTeX RDF
15	Pingzhi Yuan	Subsequence Sums Of Zero-Sum Free Sequences II.	Ars Comb.	2014	DBLP BibTeX RDF
15	Jesús E. García, Verónica Andrea González-López	Independence tests for continuous random variables based on the longest increasing subsequence.	J. Multivar. Anal.	2014	DBLP DOI BibTeX RDF
15	Delaram Jarchi, Charence Wong, Richard Mark Kwasnicki, Ben W. Heller, Garry A. Tew, Guang-Zhong Yang	Gait Parameter Estimation From a Miniaturized Ear-Worn Sensor Using Singular Spectrum Analysis and Longest Common Subsequence.	IEEE Trans. Biomed. Eng.	2014	DBLP DOI BibTeX RDF
15	Leonardo Onofri, Paolo Soda, Giulio Iannello	Multiple subsequence combination in human action recognition.	IET Comput. Vis.	2014	DBLP DOI BibTeX RDF
15	Yung-Hsing Peng, Chang-Biau Yang	Finding the gapped longest common subsequence by incremental suffix maximum queries.	Inf. Comput.	2014	DBLP DOI BibTeX RDF
15	Shegufta Bakht Ahsan, Syeda Persia Aziz, M. Sohel Rahman	Longest Common Subsequence Problem for Run-Length-Encoded Strings.	J. Comput.	2014	DBLP BibTeX RDF
15	Antonina Nepeivoda	Turchin's Relation and Subsequence Relation in Loop Approximation.	Ershov Memorial Conference (Posters)	2014	DBLP DOI BibTeX RDF
15	Navin Madicar, Haemwaan Sivaraks, Sura Rodpongpun, Chotirat Ann Ratanamahatana	An Enhanced Parameter-Free Subsequence Time Series Clustering for High-Variability-Width Data.	SCDM	2014	DBLP DOI BibTeX RDF
15	Abdullah Mueen 0001, Hossein Hamooni, Trilce Estrada	Time Series Join on Subsequence Correlation.	ICDM	2014	DBLP DOI BibTeX RDF
15	Philip Bille, Patrick Hagge Cording, Inge Li Gørtz	Compressed Subsequence Matching and Packed Tree Coloring.	CPM	2014	DBLP DOI BibTeX RDF
15	Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi	Efficient List-Based Computation of the String Subsequence Kernel.	LATA	2014	DBLP DOI BibTeX RDF
15	Hao Wan 0002, Carolina Ruiz, Joseph E. Beck	A Novel Feature Generation Method for Sequence Classification - Mutated Subsequence Generation.	BIOINFORMATICS	2014	DBLP DOI BibTeX RDF
15	Chih-Yi Chiu, Yu-Cyuan Liou, Tsung-Han Tsai	Approximate Hough transform for video subsequence matching.	ICME Workshops	2014	DBLP DOI BibTeX RDF
15	Shrey Dutta, Hema A. Murthy	A modified rough longest common subsequence algorithm for motif spotting in an Alapana of Carnatic Music.	NCC	2014	DBLP DOI BibTeX RDF
15	Yun Xue, TieChen Li, Zhiwen Liu, Zhengling Liao, Hua Xiao, Hongya Zhao, Xiaohui Hu	A common-subsequence-based approach for mining deep order preserving submatrix.	FSKD	2014	DBLP DOI BibTeX RDF
15	Attia Nehar, Abdelkader Benmessaoud, Hadda Cherroun, Djelloul Ziadi	Subsequence kernels-based Arabic text classification.	AICCSA	2014	DBLP DOI BibTeX RDF
15	Adnan Ozsoy, Arun Chauhan 0001, D. Martin Swany	Fast Longest Common Subsequence with General Integer Scoring Support on GPUs.	PMAM	2014	DBLP DOI BibTeX RDF
15	Thomas C. Kübler, Enkelejda Kasneci, Wolfgang Rosenstiel	SubsMatch: scanpath similarity in dynamic scenes based on subsequence frequencies.	ETRA	2014	DBLP DOI BibTeX RDF
15	Lech Duraj	A linear algorithm for 3-letter longest common weakly increasing subsequence.	Inf. Process. Lett.	2013	DBLP DOI BibTeX RDF
15	Helman Stern, Merav Shmueli, Sigal Berman	Most discriminating segment - Longest common subsequence (MDSLCS) algorithm for dynamic hand gesture classification.	Pattern Recognit. Lett.	2013	DBLP DOI BibTeX RDF
15	Youhei Namiki, Takashi Ishida 0002, Yutaka Akiyama	Acceleration of sequence clustering using longest common subsequence filtering.	BMC Bioinform.	2013	DBLP DOI BibTeX RDF
15	Darya Frolova, Helman Stern, Sigal Berman	Most Probable Longest Common Subsequence for Recognition of Gesture Character Input.	IEEE Trans. Cybern.	2013	DBLP DOI BibTeX RDF
15	Mauro Castelli, Stefano Beretta 0001, Leonardo Vanneschi	A hybrid genetic algorithm for the repetition free longest common subsequence problem.	Oper. Res. Lett.	2013	DBLP DOI BibTeX RDF
15	Johra Muhammad Moosa, M. Sohel Rahman, Fatema Tuz Zohora	Computing a longest common subsequence that is almost increasing on sequences having no repeated elements.	J. Discrete Algorithms	2013	DBLP DOI BibTeX RDF
15	Ricardo C. Corrêa, Pablo Mayckon Silva Farias, Críston P. de Souza	Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence.	J. Discrete Algorithms	2013	DBLP DOI BibTeX RDF
15	Zi Huang, Jiajun Liu, Bin Cui 0001, Xiaoyong Du 0001	A Gram-Based String Paradigm for Efficient Video Subsequence Search.	IEEE Trans. Multim.	2013	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz, Szymon Grabowski	Efficient algorithms for the longest common subsequence in $k$-length substrings.	CoRR	2013	DBLP BibTeX RDF
15	Marcos A. Kiwi, Cristina G. Fernandes	Repetition-free longest common subsequence of random sequences	CoRR	2013	DBLP BibTeX RDF
15	Arindam Chaudhuri	A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique.	CoRR	2013	DBLP BibTeX RDF
15	Tirtharaj Dash, Tanistha Nayak	Parallel Algorithm for Longest Common Subsequence in a String.	CoRR	2013	DBLP BibTeX RDF
15	Alex Chen, Timothy Chu, Nathan Pinsker	Computing the Longest Increasing Subsequence of a Sequence Subject to Dynamic Insertion.	CoRR	2013	DBLP BibTeX RDF
15	Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann	Efficient algorithms for the longest common subsequence problem with sequential substring constraints.	J. Complex.	2013	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz, Agnieszka Danek	Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem.	Int. J. Found. Comput. Sci.	2013	DBLP DOI BibTeX RDF
15	Konstantina Barkoula, George Economou, Spiros Fotopoulos	Online signature verification based on signatures turning angle representation using longest common subsequence matching.	Int. J. Document Anal. Recognit.	2013	DBLP DOI BibTeX RDF
15	Daxin Zhu, Xiaodong Wang 0003	A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint.	Algorithms	2013	DBLP DOI BibTeX RDF
15	Tianyu Li, Fangyan Dong, Kaoru Hirota	Distance Measure for Symbolic Approximation Representation with Subsequence Direction for Time Series Data Mining.	J. Adv. Comput. Intell. Intell. Informatics	2013	DBLP DOI BibTeX RDF
15	Sam Blasiak, Huzefa Rangwala, Kathryn B. Laskey	Relevant Subsequence Detection with Sparse Dictionary Learning.	ECML/PKDD (1)	2013	DBLP DOI BibTeX RDF
15	Christian Lang 0002, Sven Wachsmuth, Marc Hanheide, Heiko Wersing	Facial communicative signal interpretation in human-robot interaction by discriminative video subsequence selection.	ICRA	2013	DBLP DOI BibTeX RDF
15	Chih-Yi Chiu, Yi-Cheng Jhuang, Guei-Wun Han, Li-Wei Kang	Near-duplicate subsequence matching for video streams.	APSIPA	2013	DBLP DOI BibTeX RDF
15	Zilong Wang, Sitao Huang, Lanjun Wang, Hao Li, Yu Wang 0002, Huazhong Yang	Accelerating subsequence similarity search based on dynamic time warping distance with FPGA.	FPGA	2013	DBLP DOI BibTeX RDF
15	Huanmei Wu, Indra J. Das, Qingya Zhao, HuaAng Chen, Minghui Lu, Chee-Wai Cheng	Subsequence based treatment failure detection and intervention in image guided radiotherapy.	ICIS	2013	DBLP DOI BibTeX RDF
15	Ozkan Cigdem, Tinne De Laet, Joris De Schutter	Classical and subsequence dynamic time warping for recognition of rigid body motion trajectories.	ASCC	2013	DBLP DOI BibTeX RDF
15	Sitao Huang, Guohao Dai, Yuliang Sun, Zilong Wang, Yu Wang 0002, Huazhong Yang	DTW-Based Subsequence Similarity Search on AMD Heterogeneous Computing Platform.	HPCC/EUC	2013	DBLP DOI BibTeX RDF
15	Miao Du, Jean-Guy Schneider, Cameron M. Hine, John Grundy 0001, Steven Versteeg	Generating service models by trace subsequence substitution.	QoSA	2013	DBLP DOI BibTeX RDF
15	Jens Barth, Cäcilia Oberndorfer, Patrick Kugler, Dominik Schuldhaus, Jürgen Winkler, Jochen Klucken, Björn M. Eskofier	Subsequence dynamic time warping as a method for robust step segmentation using gyroscope signals of daily life activities.	EMBC	2013	DBLP DOI BibTeX RDF
15	Rohit Jain, Mukesh K. Mohania, Sunil Prabhakar	Efficient Subsequence Search in Databases.	WAIM	2013	DBLP DOI BibTeX RDF
15	Jiun-Jian Liaw, Wen-Shen Wang, Hung-Chi Chu, Meng-Sian Huang, Chuan-Pin Lu	Recognition of the Ambulance Siren Sound in Taiwan by the Longest Common Subsequence.	SMC	2013	DBLP DOI BibTeX RDF
15	Adnan Ozsoy, Arun Chauhan 0001, D. Martin Swany	Achieving TeraCUPS on Longest Common Subsequence Problem Using GPGPUs.	ICPADS	2013	DBLP DOI BibTeX RDF
15	Xavier Anguera, Miquel Ferrarons	Memory efficient subsequence DTW for Query-by-Example Spoken Term Detection.	ICME	2013	DBLP DOI BibTeX RDF
15	Laura Alejandra Pinilla-Buitrago, José Francisco Martínez Trinidad, Jesús Ariel Carrasco-Ochoa	New Penalty Scheme for Optimal Subsequence Bijection.	CIARP (1)	2013	DBLP DOI BibTeX RDF
15	Kristina Blokhin, Joshua Saxe, David Mentis	Malware Similarity Identification Using Call Graph Based System Call Subsequence Features.	ICDCS Workshops	2013	DBLP DOI BibTeX RDF
15	Christian Blum 0001, Maria J. Blesa, Borja Calvo	Beam-ACO for the Repetition-Free Longest Common Subsequence Problem.	Artificial Evolution	2013	DBLP DOI BibTeX RDF
15	Xueyuan Gong, Yain-Whar Si	Comparison of Subsequence Pattern Matching Methods for Financial Time Series.	CIS	2013	DBLP DOI BibTeX RDF
15	Agnieszka Danek, Sebastian Deorowicz	Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem.	ICMMI	2013	DBLP DOI BibTeX RDF
15	Gary Benson, Avivit Levy, B. Riva Shalom	Longest Common Subsequence in k Length Substrings.	SISAP	2013	DBLP DOI BibTeX RDF
15	Xiao-Ying Liu 0003, Chuan-Lun Ren	Fast subsequence matching under time warping in time-series databases.	ICMLC	2013	DBLP DOI BibTeX RDF
15	Amit Chakrabarti	A note on randomized streaming space bounds for the longest increasing subsequence problem.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
15	Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora	On the parameterized complexity of the repetition free longest common subsequence problem.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
15	Sebastian Deorowicz	A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem.	Comput. Informatics	2012	DBLP BibTeX RDF
15	Sayyed Rasoul Mousavi, Farzaneh Tabataba	An improved algorithm for the longest common subsequence problem.	Comput. Oper. Res.	2012	DBLP DOI BibTeX RDF
15	Yoshifumi Sakai	A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2012	DBLP DOI BibTeX RDF
15	Philip Bille, Inge Li Gørtz	Fast Arc-Annotated Subsequence Matching in Linear Space.	Algorithmica	2012	DBLP DOI BibTeX RDF
15	Muhammad Rashed Alam, M. Sohel Rahman	The substring inclusion constraint longest common subsequence problem can be solved in quadratic time.	J. Discrete Algorithms	2012	DBLP DOI BibTeX RDF
15	Petr Volny, David Novak, Pavel Zezula	Employing Subsequence Matching in Audio Data Processing	CoRR	2012	DBLP BibTeX RDF
15	Ricardo C. Corrêa, Pablo Mayckon Silva Farias, Críston P. de Souza	Insertion and Sorting in a Sequence of Numbers Minimizing the Maximum Sum of a Contiguous Subsequence	CoRR	2012	DBLP BibTeX RDF
15	David Novak, Petr Volny, Pavel Zezula	Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency	CoRR	2012	DBLP BibTeX RDF
15	Haohan Zhu, George Kollios, Vassilis Athitsos	A Generic Framework for Efficient and Effective Subsequence Retrieval	CoRR	2012	DBLP BibTeX RDF
15	Andy Nguyen	Solving Cyclic Longest Common Subsequence in Quadratic Time	CoRR	2012	DBLP BibTeX RDF
15	Farzaneh Sadat Tabataba, Sayyed Rasoul Mousavi	A hyper-heuristic for the Longest Common Subsequence problem.	Comput. Biol. Chem.	2012	DBLP DOI BibTeX RDF
15	Haohan Zhu, George Kollios, Vassilis Athitsos	A Generic Framework for Efficient and Effective Subsequence Retrieval. (PDF / PS)	Proc. VLDB Endow.	2012	DBLP DOI BibTeX RDF
15	Alexios Kotsifakos, Panagiotis Papapetrou, Jaakko Hollmén, Dimitrios Gunopulos, Vassilis Athitsos, George Kollios	Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System. (PDF / PS)	Proc. VLDB Endow.	2012	DBLP DOI BibTeX RDF
15	Sura Rodpongpun, Vit Niennattrakul, Chotirat Ann Ratanamahatana	Selective Subsequence Time Series clustering.	Knowl. Based Syst.	2012	DBLP DOI BibTeX RDF
15	Xiangmin Zhou, Xiaofang Zhou 0001, Lei Chen 0002, Athman Bouguettaya	Efficient subsequence matching over large video databases.	VLDB J.	2012	DBLP DOI BibTeX RDF
15	Rodrigo Alexander Castro Campos, Francisco Javier Zaragoza Martínez	Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem.	CCE	2012	DBLP DOI BibTeX RDF
15	Sean Banerjee, Bojan Cukic, Donald A. Adjeroh	Automated Duplicate Bug Report Classification Using Subsequence Matching.	HASE	2012	DBLP DOI BibTeX RDF
15	Yoshifumi Sakai	Computing the Longest Common Subsequence of Two Run-Length Encoded Strings.	ISAAC	2012	DBLP DOI BibTeX RDF
15	Johann Steinbrecher, Weijia Shang	On Optimizing the Longest Common Subsequence Problem by Loop Unrolling Along Wavefronts.	PDP	2012	DBLP DOI BibTeX RDF
15	Yu Peng, Raymond Chi-Wing Wong, Liangliang Ye, Philip S. Yu	Attribute-Based Subsequence Matching and Mining.	ICDE	2012	DBLP DOI BibTeX RDF
15	Hongyu Guo, Dongmei Huang, Xiaoqun Zhao	An algorithm for spoken keyword spotting via subsequence DTW.	IC-NIDC	2012	DBLP DOI BibTeX RDF
15	David Novak, Petr Volny, Pavel Zezula	Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency.	DEXA (2)	2012	DBLP DOI BibTeX RDF
15	Guillaume Blin, Laurent Bulteau, Minghui Jiang 0001, Pedro J. Tejada, Stéphane Vialette	Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths.	CPM	2012	DBLP DOI BibTeX RDF
15	Gede Putra Kusuma, Attila Szabó, Yiqun Li, Jimmy Addison Lee	Appearance-based object recognition using weighted longest increasing subsequence.	ICPR	2012	DBLP BibTeX RDF
15	Kong Mu, Guo Qin	Improved Method of Relation Extraction Using Subsequence Kernel.	CICSyN	2012	DBLP DOI BibTeX RDF