Sciweavers

21520 search results - page 279 / 4304
» Symmetric network computation
Sort
View
COCOON
2008
Springer
15 years 8 months ago
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
Xianchao Zhang, Weifa Liang, Guoliang Chen
ICC
2007
IEEE
127views Communications» more  ICC 2007»
16 years 1 months ago
Inter-Domain Path Computation using Improved Crankback Signaling in Label Switched Networks
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...
Faisal Aslam, Zartash Afzal Uzmi, Adrian Farrel, M...
IEEEARES
2006
IEEE
16 years 22 days ago
Identifying Intrusions in Computer Networks with Principal Component Analysis
Most current anomaly Intrusion Detection Systems (IDSs) detect computer network behavior as normal or abnormal but cannot identify the type of attacks. Moreover, most current intr...
Wei Wang, Roberto Battiti
ISCIS
2005
Springer
16 years 6 days ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
CN
2010
109views more  CN 2010»
15 years 6 months ago
A taxonomy of biologically inspired research in computer networking
The natural world is enormous, dynamic, incredibly diverse, and highly complex. Despite the inherent challenges of surviving in such a world, biological organisms evolve, self-org...
Michael Meisel, Vasileios Pappas, Lixia Zhang