Sciweavers

490 search results - page 39 / 98
» Impossibilities for roommate problems
Sort
View
ALGOSENSORS
2008
Springer
14 years 11 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
CORR
2007
Springer
119views Education» more  CORR 2007»
14 years 9 months ago
Distributed Source Coding in the Presence of Byzantine Sensors
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
Oliver Kosut, Lang Tong
MP
2006
119views more  MP 2006»
14 years 9 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
SIGOPS
2010
132views more  SIGOPS 2010»
14 years 8 months ago
A case for the accountable cloud
For many companies, clouds are becoming an interesting alternative to a dedicated IT infrastructure. However, cloud computing also carries certain risks for both the customer and ...
Andreas Haeberlen
ICASSP
2011
IEEE
14 years 1 months ago
Variational Bayesian Kalman filtering in dynamical tomography
The problem of dynamical tomography consists in reconstructing a temporal sequence of images from their noisy projections. For this purpose, a recursive algorithm is usually used,...
Boujemaa Ait-El-Fquih, Thomas Rodet