Subsequence - PDFSEARCH.IO - Document Search Engine

Subsequence
Results: 100

#	Item
31	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 13 March 13, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 Control theory Longest common subsequence problem Algorithm Substring Longest common substring problem Fibonacci number Overlapping subproblems Longest increasing subsequence Dynamic programming Mathematics Applied mathematics
32	Journal of Computational and Applied Mathematics–105 www.elsevier.com/locate/cam Hydrodynamical methods for analyzing longest increasing subsequences a Add to Reading List Source URL: dutiosb.twi.tudelft.nl Language: English - Date: 2002-06-26 04:17:32 Probability theory Dynamic programming Longest increasing subsequence Poisson process Point process Convergence of random variables Permutation Statistics Stochastic processes Combinatorics
33	A global averaging method for dynamic time warping, with applications to clustering Franc¸ois Petitjeana,b,c,∗, Alain Ketterlina , Pierre Ganc¸arskia,b a University of Strasbourg, 7 rue Ren´e Descartes, 67084 Strasb Add to Reading List Source URL: dpt-info.u-strasbg.fr Language: English - Date: 2012-06-13 07:33:17 Bioinformatics Dynamic time warping Time series analysis Computational phylogenetics Computational linguistics Speech recognition Sequence Cluster analysis Longest common subsequence problem Statistics Dynamic programming Mathematics
34	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: www.girlsangle.org Language: English - Date: 2014-06-30 23:41:00 Subsequence Algorithm Addition Number Longest increasing subsequence Matrix chain multiplication Mathematics Brahmagupta Dynamic programming
35	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
36	An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT Add to Reading List Source URL: xmailserver.org Language: English - Date: 2007-02-16 03:04:45 Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory
37	Algorithms Lecture 3: Backtracking [Fa’14] ’Tis a lesson you should heed, Try, try again; Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:21 Search algorithms Computability theory Theory of computation Programming idioms Backtracking Recursion Eight queens puzzle Tree traversal Longest increasing subsequence Mathematics Applied mathematics Theoretical computer science
38	CS 373 Final Exam Questions (May 7, 2001) Spring 2001 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:30 Algorithm Palindrome Subsequence Clique problem Mathematics Theoretical computer science Clique
39	Algorithms Lecture 5: Dynamic Programming [Fa’14] Those who cannot remember the past are doomed to repeat it. — George Santayana, The Life of Reason, Book I: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:26 Dynamic programming Mathematical logic Operations research Programming idioms Algorithm Levenshtein distance Recursion Longest increasing subsequence Fibonacci number Mathematics Applied mathematics Theoretical computer science
40	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:15 Analysis of algorithms Computational complexity theory Operations research Dynamic programming Algorithms Sorting algorithm Randomized algorithm Longest increasing subsequence Time complexity Theoretical computer science Applied mathematics Mathematics