Sciweavers

2421 search results - page 34 / 485
» Approximate Flow-Aware Networking
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
OPODIS
2003
14 years 11 months ago
Transient Model for Jackson Networks and Its Approximation
Jackson networks have been very successful in so many areas in modeling parallel and distributed systems. However, the ability of Jackson networks to predict performance with syste...
Ahmed M. Mohamed, Lester Lipsky, Reda A. Ammar
NN
1998
Springer
14 years 9 months ago
Multilayer neural networks and Bayes decision theory
There are many applications of multilayer neural networks to pattern classification problems in the engineering field. Recently, it has been shown that Bayes a posteriori probab...
Ken-ichi Funahashi
CNSR
2011
IEEE
257views Communications» more  CNSR 2011»
14 years 1 months ago
On Threshold Selection for Principal Component Based Network Anomaly Detection
—Principal component based anomaly detection has emerged as an important statistical tool for network anomaly detection. It works by projecting summary network information onto a...
Petar Djukic, Biswajit Nandy
TMC
2011
131views more  TMC 2011»
14 years 4 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan