✦ LIBER ✦

Fast updating algorithms for TCAM

✍ Scribed by Shah, D.; Gupta, P.

Book ID: 117878531
Publisher: IEEE
Year: 2001
Tongue: English
Weight: 333 KB
Volume: 21
Category: Article
ISSN: 0272-1732
DOI: 10.1109/40.903060

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a trie partitioning algorithm for pow

On a trie partitioning algorithm for power-efficient TCAMs

✍ Haibin Lu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 391 KB

Modified winner-update search algorithm

Modified winner-update search algorithm for fast block matching

✍ Jingli Zhou; Jun Li; Shengsheng Yu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 567 KB

Based on the study of winner-update search (WUS) algorithm, a modified WUS (MWUS) algorithm for fast blockmatching motion estimation is proposed in this paper. The computational reduction without any degradation in predicted image comes from fast elimination of impossible motion vectors. We obtain f

Algorithms for updating minimal spanning

Algorithms for updating minimal spanning trees

✍ Francis Chin; David Houck 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 641 KB

Parallel updating algorithms for graph s

Parallel updating algorithms for graph searching problems

✍ Pranay Chaudhuri 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 776 KB

Fast subsampled-updating stabilized fast

Fast subsampled-updating stabilized fast transversal filter (FSU SFTF) RLS algorithm for adaptive filtering

✍ Maouche, K.; Slock, D.T.M. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 265 KB

The fast subsampled-updating fast transv

The fast subsampled-updating fast transversal filter (FSU FTF) RLS algorithm

✍ Dirk T. M. Slock; Karim Maouche 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 552 KB