Sciweavers

46931 search results - page 368 / 9387
» Networking the networks
Sort
View
ICDCSW
2006
IEEE
16 years 26 days ago
Characterization of a Connectivity Measure for Sparse Wireless Multi-hop Networks
The extent to which a wireless multi-hop network is connected is usually measured by the probability that all the nodes form a single connected component. We find this measure, c...
Srinath Perur, Sridhar Iyer
ICC
2009
IEEE
121views Communications» more  ICC 2009»
15 years 4 months ago
Designing Demand-Wise Shared Protection Networks with Specified Minimum Dual-Failure Restorability
-- We develop a new integer linear programming model to optimally design demand-wise shared protection (DSP) networks to achieve specified minimum levels of dual-failure restorabil...
Jude Akpuh, John Doucette
137
Voted
ADCM
2000
45views more  ADCM 2000»
15 years 6 months ago
Training neural networks with noisy data as an ill-posed problem
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...
Martin Burger, Heinz W. Engl
CN
2002
98views more  CN 2002»
15 years 6 months ago
New models and algorithms for programmable networks
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...
Danny Raz, Yuval Shavitt
ENTCS
2007
131views more  ENTCS 2007»
15 years 6 months ago
Secure Node Discovery in Ad-hoc Networks and Applications
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
Giovanni Di Crescenzo