منابع مشابه
Channel Assignment via Fast Zeta Transform
We show an O∗((l + 1)n)-time algorithm for the channel assignment problem, where l is the maximum edge weight. This improves on the previous O∗((l + 2)n)-time algorithm by Kral [4], as well as algorithms for important special cases, like L(2, 1)-labelling. For the latter problem, our algorithm works in O∗(3n) time. The progress is achieved by applying the fast zeta transform in combination with...
متن کاملFast Approximate Fourier Transform via Wavelets Transform
We propose an algorithm that uses the discrete wavelet transform (DWT) as a tool to compute the discrete Fourier transform (DFT). The Cooley-Tukey FFT is shown to be a special case of the proposed algorithm when the wavelets in use are trivial. If no intermediate coeecients are dropped and no approximations are made, the proposed algorithm computes the exact result, and its computational comple...
متن کاملFast Channel Assignment in Cellular Radio Systems
This paper proposes a new algorithm using a nonpositive neural network model to solve channel assignment problems in arbitrary cellular mobile radio systems. Unlike traditional neural nets used in optimization problems, the proposed network is guaranteed to deliver valid solutions after every update and needs no parameter tuning. The power of the new method to solve this NP-complete problem wil...
متن کاملA fast constructive algorithm for fixed channel assignment problem
With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becomes increasingly important. It has been shown that this problem is equivalent to the graph-coloring problem, which is an NP-hard problem [l]. In this work, a fast constructive algorithm is introduced to solve the problem. The objective of the algorithni is to obtain ...
متن کاملFast spherical Bessel transform via fast Fourier transform and recurrence formula
We propose a new method for the numerical evaluation of the spherical Bessel transform. A formula is derived for the transform by using an integral representation of the spherical Bessel function and by changing the integration variable. The resultant algorithm consists of a set of the Fourier transforms and numerical integrations over a linearly spaced grid of variable k in Fourier space. Beca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2011
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2011.05.008