Sciweavers

103 search results - page 9 / 21
» A bidirected generalization of network matrices
Sort
View
MSN
2005
Springer
15 years 3 months ago
Dual Binding Update with Additional Care of Address in Network Mobility
In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Dual Binding Update (DBU ). In general, the nested mobile network...
Kwang Chul Jeong, Tae-Jin Lee, Hyunseung Choo
NIPS
1993
14 years 11 months ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
15 years 7 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
CORR
2008
Springer
149views Education» more  CORR 2008»
14 years 8 months ago
MIMO Networks: the Effects of Interference
Multiple-input multiple-output (MIMO) systems are being considered as one of the key enabling technologies for future wireless networks. However, the decrease in capacity due to th...
Marco Chiani, Moe Z. Win, Hyundong Shin
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
15 years 7 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd