Yüklüyor......
Families of FPGA-Based Accelerators for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many implementations have reported impressive speed-ups, but have typically been point solutions – highly specialized and addressi...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
2007
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3096528/ https://ncbi.nlm.nih.gov/pubmed/21603598 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.micpro.2006.04.001 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|