Sciweavers

1629 search results - page 212 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
STOC
1995
ACM
126views Algorithms» more  STOC 1995»
15 years 1 months ago
A computational view of population genetics
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
ICASSP
2011
IEEE
14 years 1 months ago
Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
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...
ECAI
2010
Springer
14 years 7 months ago
On Computing Backbones of Propositional Theories
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
João Marques-Silva, Mikolás Janota, ...
CORR
2010
Springer
113views Education» more  CORR 2010»
14 years 8 months ago
A Strategy to enable Prefix of Multicast VoD through dynamic buffer allocation
In this paper we have proposed a dynamic buffer allocation algorithm for the prefix, based on the popularity of the videos. More cache blocks are allocated for most popular videos...
T. R. Gopalakrishnan Nair, P. Jayarekha