Sciweavers

14165 search results - page 344 / 2833
» The generalized two-server problem
Sort
View
ISPDC
2007
IEEE
16 years 1 months ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky
ACL
2000
15 years 8 months ago
A Polynomial-Time Fragment of Dominance Constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
Alexander Koller, Kurt Mehlhorn, Joachim Niehren
CAD
2011
Springer
15 years 1 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
TSP
2012
14 years 2 months ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
ICC
2008
IEEE
161views Communications» more  ICC 2008»
16 years 1 months ago
Joint Power Control and Link Scheduling in Wireless Networks for Throughput Optimization
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
Liqun Fu, Soung Chang Liew, Jianwei Huang