2168 search results - page 188 / 434 » Randomized Algorithms and Complexity Theory |
126
Voted
CPM
1993
Springer
15 years 7 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
142
Voted
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
124
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
142
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
The problem of interference alignment in time-varying MIMO interference channels is considered. To reduce complexity, an adaptive algorithm for beam vector design is proposed base...
165
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...