Sciweavers

31 search results - page 4 / 7
» Constrained LCS: Hardness and Approximation
Sort
View
108
Voted
TSP
2012
13 years 5 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...
CVPR
2004
IEEE
15 years 11 months ago
Estimation, Smoothing, and Characterization of Apparent Diffusion Coefficient Profiles from High Angular Resolution DWI
We present a new variational framework for recovery of apparent diffusion coefficient (ADC) from High Angular Resolution Diffusion-weighted (HARD) MRI. The model approximates the ...
Yunmei Chen, Weihong Guo, Qingguo Zeng, Xiaolu Yan...
MST
2007
167views more  MST 2007»
14 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ALGOSENSORS
2007
Springer
15 years 3 months ago
Assigning Sensors to Missions with Demands
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
TOG
2008
115views more  TOG 2008»
14 years 9 months ago
Animating developable surfaces using nonconforming elements
We present a new discretization for the physics-based animation of developable surfaces. Constrained to not deform at all in-plane but free to bend out-of-plane, these are an exce...
Elliot English, Robert Bridson