Browsing Computer Science by Subject "dynamic programming"
Now showing items 1-3 of 3
-
The application of the in-tree knapsack problem to routing prefix caches
(University of Waterloo, 2009-04-30)Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact that TCAM is a non-standard type of memory and ... -
SPIDER: Reconstructive Protein Homology Search with De Novo Sequencing Tags
(University of Waterloo, 2011-04-21)In the field of proteomic mass spectrometry, proteins can be sequenced by two independent yet complementary algorithms: de novo sequencing which uses no prior knowledge and database search which relies upon existing protein ... -
Subseries Join and Compression of Time Series Data Based on Non-uniform Segmentation
(University of Waterloo, 2008-09-24)A time series is composed of a sequence of data items that are measured at uniform intervals. Many application areas generate or manipulate time series, including finance, medicine, digital audio, and motion capture. ...