3247 search results - page 41 / 650 » Randomized smoothing networks |
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
ICANN
2009
Springer
15 years 6 months ago
2009
Springer
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
108
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—In our previous work [11], we derived detection delay and detection probability for a randomized scheduling algorithm in wireless sensor networks. In this paper, we study asympt...