Sciweavers

3415 search results - page 450 / 683
» Lower bounds on kernelization
Sort
View
TCS
2012
14 years 2 months ago
Deterministic recurrent communication in restricted Sensor Networks
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...
Antonio Fernández Anta, Miguel A. Mosteiro,...
JMLR
2012
13 years 9 months ago
Factorized Asymptotic Bayesian Inference for Mixture Modeling
This paper proposes a novel Bayesian approximation inference method for mixture modeling. Our key idea is to factorize marginal log-likelihood using a variational distribution ove...
Ryohei Fujimaki, Satoshi Morinaga
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 9 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
EUROCRYPT
2012
Springer
13 years 9 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
IPPS
2010
IEEE
15 years 4 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb