191 search results - page 21 / 39 » Time and area efficient pattern matching on FPGAs |
125
Voted
CPM
1998
Springer
15 years 1 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
94
Voted
IJCV
2006
14 years 9 months ago
2006
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
EUC
2007
Springer
15 years 1 months ago
2007
Springer
With the wide adoption of internet into our everyday lives, internet security becomes an important issue. Intrusion detection at the network level is an effective way of stopping m...
82
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
ASAP
2008
IEEE
15 years 4 months ago
2008
IEEE
Cooperative MIMO is a new technique that allows disjoint wireless communication nodes (e.g. wireless sensors) to form a virtual antenna array to increase bandwidth, reliability an...