Sciweavers

1617 search results - page 116 / 324
» Constraints in Weighted Averaging
Sort
View
TWC
2008
225views more  TWC 2008»
15 years 6 months ago
Joint rate and power allocation for cognitive radios in dynamic spectrum access environment
Abstract--We investigate the dynamic spectrum sharing problem among primary and secondary users in a cognitive radio network. We consider the scenario where primary users exhibit o...
Dong In Kim, Long Le, Ekram Hossain
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...
CORR
2011
Springer
194views Education» more  CORR 2011»
15 years 1 months ago
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
Paul N. Balister, Béla Bollobás, Ani...
CVPR
2006
IEEE
16 years 8 months ago
Accurate Face Alignment using Shape Constrained Markov Network
In this paper, we present a shape constrained Markov network for accurate face alignment. The global face shape is defined as a set of weighted shape samples which are integrated ...
Lin Liang, Fang Wen, Ying-Qing Xu, Xiaoou Tang, He...
FOCS
2002
IEEE
15 years 11 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor