Realizing a Sub-Linear Time String-Matching Algorithm With a Hardware Accelerator Using Bloom Filters

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - United States
doi 10.1109/tvlsi.2008.2012011
Full Text
Abstract

Available in full text

Date
Authors

Unknown

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Longest Prefix Matching Using Bloom Filters

2003English

Parallel String Matching Algorithm Using Grid

International Journal of Distributed and Parallel systems
2012English

A Polynomial-Time Algorithm for a Stable Matching Problem With Linear Valuations and Bounded Side Payments

Japan Journal of Industrial and Applied Mathematics
EngineeringApplied Mathematics
2008English

Cache Locality-Centric Parallel String Matching on Many-Core Accelerator Chips

Scientific Programming
Computer Science ApplicationsSoftware
2015English

A Unique Sorting Algorithm With Linear Time & Space Complexity

International Journal of Research in Engineering and Technology
2014English

Realization and Application of a Sub-Linear Time Complexity Correlation Algorithm to a Passive Radar System

2016English

A Threshold Controller for FAST Hardware Accelerator

Journal of the Institute of Electronics and Information Engineers
2014English

Improving Bloom Filter Performance on Sequence Data Using $$K$$ -Mer Bloom Filters

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

A Novel Hardware-Oriented Stereo Matching Algorithm and Its Architecture Design in FPGA

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy