191 search results - page 4 / 39 » Time and area efficient pattern matching on FPGAs |
KES
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents our implemented, synthesized and tested on demand and partial reconfiguration approaches for FIR filters using Xilinx Virtex FPGAs. Our scope is to implement a ...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
A novel approach to pattern matching is presented, which reduces time complexity by two orders of magnitude compared to traditional approaches. The suggested approach uses an effi...
GLVLSI
2009
IEEE
14 years 12 days ago
2009
IEEE
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
DLT
2004
13 years 10 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
KDD
1997
ACM
14 years 20 days ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...