Sciweavers

279 search results - page 19 / 56
» Type-II Optimal Polynomial Bases
Sort
View
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
14 years 3 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
ICASSP
2011
IEEE
13 years 13 days ago
Interpolation based on stationary and adaptive AR(1) modeling
In this paper, we describe a minimal mean square error (MMSE) optimal interpolation filter for discrete random signals. We explicitly derive the interpolation filter for a firs...
Eija Johansson, Marie Strom, Mats Viberg, Lennart ...
WWW
2005
ACM
14 years 9 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa
MFCS
2004
Springer
14 years 2 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
ICCAD
1994
IEEE
61views Hardware» more  ICCAD 1994»
14 years 26 days ago
Simultaneous driver and wire sizing for performance and power optimization
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
Jason Cong, Cheng-Kok Koh