Sciweavers

467 search results - page 34 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
TEC
2002
183views more  TEC 2002»
14 years 11 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
NETWORKS
2010
14 years 10 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
ICASSP
2011
IEEE
14 years 3 months ago
Complex random matrices and multiple-antenna spectrum sensing
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...
Tharmalingam Ratnarajah, Caijun Zhong, Ayse Kortun...
SIAMCO
2002
70views more  SIAMCO 2002»
14 years 11 months ago
Lossless and Dissipative Distributed Systems
This paper deals with linear shift-invariant distributed systems. By this we mean systems described by constant coefficient linear partial differential equations. We define dissipa...
Harish K. Pillai, Jan C. Willems
SIAMNUM
2010
131views more  SIAMNUM 2010»
14 years 6 months ago
A Rational Interpolation Scheme with Superpolynomial Rate of Convergence
The purpose of this study is to construct a high-order interpolation scheme for arbitrary scattered datasets. The resulting function approximation is an interpolation function when...
Qiqi Wang, Parviz Moin, Gianluca Iaccarino