1510 search results - page 96 / 302 » Upper Probabilities and Additivity |
TRANSCI
2011
14 years 4 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
117
click to vote
ICASSP
2011
IEEE
2011
IEEE
Analysis of the security of linear blinding techniques from an information theoretical point of view
14 years 1 months ago
We propose a novel model to characterize the security of linear blinding techniques. The proposed model relates the security of blinding to the possibility of estimating the blind...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In previous work, a water-filling algorithm was proposed which sought to minimize the mean square error (MSE) at any given time by optimally choosing the gains (i.e. step-sizes) ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The performance of a fixed beamformer highly depends on the position of the microphones in the array. In this paper, different heuristic optimisation approaches for arbitrary pla...
TCS
2012
13 years 5 months ago
2012
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...