Sciweavers

467 search results - page 32 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
ICC
2008
IEEE
130views Communications» more  ICC 2008»
15 years 6 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
SIAMMAX
2011
180views more  SIAMMAX 2011»
14 years 6 months ago
Computing Characteristic Polynomials from Eigenvalues
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
Rizwana Rehman, Ilse C. F. Ipsen
ICML
2006
IEEE
16 years 17 days ago
Regression with the optimised combination technique
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
Jochen Garcke
CDC
2009
IEEE
112views Control Systems» more  CDC 2009»
15 years 3 months ago
A Floquet-like factorization for linear periodic systems
In this note, the novel representation is proposed for a linear periodic continuous-time system with T-periodic real-valued coefficients. We prove that a T-periodic real-valued fac...
Ichiro Jikuya, Ichijo Hodaka
IPPS
2000
IEEE
15 years 4 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi