5153 search results - page 488 / 1031 » Introduction to Randomized Algorithms |
170
Voted
IPL
2006
15 years 6 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
196
click to vote
IJON
2007
15 years 6 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
169
Voted
SIGMETRICS
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
185
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
180
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...