10608 search results - page 289 / 2122 » Complexity of O'Hara's Algorithm |
DAC
2003
ACM
16 years 1 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...
94
Voted
CORR
2008
Springer
15 years 21 days 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...
114
Voted
TSP
2010
14 years 7 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...
137
Voted
ISPDC
2005
IEEE
15 years 6 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...
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...