3 search results - page 1 / 1 » Linear and O(n log n) Time Minimum-Cost Matching Algorithms ... |
SODA
1994
ACM
13 years 6 months ago
1994
ACM
RECONFIG
2008
IEEE
13 years 11 months ago
2008
IEEE
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...