Sciweavers

33 search results - page 4 / 7
» Computing Approximate Blocking Probabilities for a Class of ...
Sort
View
ESANN
2000
13 years 6 months ago
A neural network approach to adaptive pattern analysis - the deformable feature map
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
Axel Wismüller, Frank Vietze, Dominik R. Ders...
COLT
1993
Springer
13 years 9 months ago
Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
Peter L. Bartlett
TPDS
2008
124views more  TPDS 2008»
13 years 5 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
TON
1998
145views more  TON 1998»
13 years 5 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu
ICN
2001
Springer
13 years 9 months ago
Optimal Provisioning and Pricing of Internet Differentiated Services in Hierarchical Markets
Abstract— Network service providers contract with network owners for connection rights, then offer individual users network access at a price. Within this hierarchy, the service ...
Errin W. Fulp, Douglas S. Reeves