1404 search results - page 68 / 281 » On General Laws of Complex Networks |
ICANN
2010
Springer
15 years 1 days ago
2010
Springer
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
MOBIHOC
2009
ACM
16 years 12 days ago
2009
ACM
In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according ...
STOC
1994
ACM
15 years 4 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
MOBIHOC
2009
ACM
16 years 12 days ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...