1688 search results - page 110 / 338 » The Complexity of Rationalizing Matchings |
142
click to vote
TIT
2010
15 years 14 days ago
2010
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
174
click to vote
JSC
2011
14 years 8 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
195
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
202
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
184
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper presents a novel VLSI architecture for high-speed data compressor designs which implement the well-known LZ77 algorithm. The architecture mainly consists of three units...