Subsequence - PDFSEARCH.IO - Document Search Engine

Subsequence
Results: 100

#	Item
11	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:55 Complexity classes NP-hardness NP P versus NP problem Computational complexity theory P Reduction
12	A = a x aa m if and only if there is a mapping F: {1, 2, . . . , p} ~ {1, 2, . . . , m} such that f(i) = k only if c~ is ak and F is a m o n o t o n e strictly increasing function (i.e. F(i) = u, F ( j ) = v, a Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Dynamic programming Combinatorics Subsequence Longest common subsequence problem Longest increasing subsequence HuntMcIlroy algorithm
13	SpADe: On Shape-based Pattern Detection in Streaming Time Series Yueguo Chen§ Mario A. Nascimento†∗ § Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2006-11-21 02:44:25 Dynamic programming Elementary mathematics Dynamic time warping Time series analysis Combinatorics Search algorithms Sequence Subsequence Longest common subsequence problem K-nearest neighbors algorithm Pattern matching Euclidean distance
14	Multiple Sequence Alignment and Phylogenetic Reconstruction: Theory and Methods in Biological Data Analysis Gianluca Della Vedova Add to Reading List Source URL: www.statistica.unimib.it Language: English - Date: 2004-04-21 05:50:41 Bioinformatics Computational phylogenetics Phylogenetics Combinatorics Dynamic programming Sequence alignment Multiple sequence alignment Phylo Homology Shortest common supersequence problem Longest common subsequence problem Alignment-free sequence analysis
15	PRUNING SUBSEQUENCE SEARCH WITH ATTENTION-BASED EMBEDDING Laboratory for the Recognition and Organization of Speech and Audio Colin Raffel () and Daniel P. W. Ellis (), LabROSA, Colum Add to Reading List Source URL: colinraffel.com Language: English - Date: 2016-03-23 10:40:29 Mathematics Dynamic programming Dynamic time warping Time series analysis MIDI Embedding Sequence
16	June 2014 • Volume 7 • Number 5 To Foster and Nurture Girls’ Interest in Mathematics An Interview Interview with Marie Vitulli, Part 2 Finding the Maximum Subsequence, Part 1 Add to Reading List Source URL: girlsangle.org Language: English - Date: 2014-06-30 23:41:00
17	A variational theory of hyperbolic Lagrangian Coherent Structures Add to Reading List Source URL: georgehaller.com Language: English - Date: 2015-06-08 10:21:03 Chaos theory Lagrangian coherent structure Turbulence Mathematics Combinatorics Physics Longest common subsequence problem Mechanics
18	Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann∗ Marvin Künnemann† Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:47:08 Dynamic programming Dynamic time warping Longest common subsequence problem Levenshtein distance Metric space Exponential time hypothesis NC
19	PRUNING SUBSEQUENCE SEARCH WITH ATTENTION-BASED EMBEDDING Colin Raffel and Daniel P. W. Ellis LabROSA Columbia University New York, NY ABSTRACT Add to Reading List Source URL: colinraffel.com Language: English - Date: 2015-12-30 23:12:50 Artificial intelligence Learning Machine learning Artificial neural networks Dynamic programming Dynamic time warping Time series analysis Computational neuroscience Deep learning Speech recognition Word2vec Sequence alignment
20	SUBSEQUENCE SUMS OF ZERO-SUM FREE SEQUENCES OVER FINITE ABELIAN GROUPS YONGKE QU, XINGWU XIA, LIN XUE, AND QINGHAI ZHONG Abstract. Let G be a finite abelian group of rank r and let X be a zero-sum free sequence over G wh Add to Reading List Source URL: qinghai-zhong.weebly.com Language: English - Date: 2015-03-23 12:29:59