191 search results - page 25 / 39 » Time and area efficient pattern matching on FPGAs |
66
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
Compound images contain a mixture of natural images, text, and graphics. They need special care in the use of compression because text and graphics cannot withstand the significan...
107
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
105
click to vote
ACL
2008
14 years 11 months ago
2008
This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to de...
73
Voted
SIAMCOMP
2008
14 years 9 months ago
2008
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...