10988 search results - page 368 / 2198 » Algorithmic Folding Complexity |
159
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
— In many application of noise cancellation, the changes in signal characteristics could be quite fast. This requires the utilization of adaptive algorithms, which converge rapid...
135
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
142
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
148
Voted
TSP
2010
14 years 11 months ago
2010
The strong cross-correlation that exists between the two input audio channels makes the problem of stereophonic acoustic echo cancellation (AEC) complex and challenging to solve. R...
169
Voted
ISPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...