405 search results - page 32 / 81 » Random Number Selection in Self-assembly |
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
— Fault injection has become a very classical method to determine the dependability of an integrated system with respect to soft errors. Due to the huge number of possible error ...
ICMCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We address the problem of distributed path selection and rate allocation for media streaming in overlay networks. Under the assumption that each node has only a local view of the ...
NIPS
2008
13 years 10 months ago
2008
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
AAECC
2005
Springer
13 years 8 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
CRYPTO
2003
Springer
14 years 2 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...