Sciweavers

13214 search results - page 268 / 2643
» Pseudorandomness for network algorithms
Sort
View
184
Voted
CCR
2008
113views more  CCR 2008»
15 years 6 months ago
Practical issues with using network tomography for fault diagnosis
This paper investigates the practical issues in applying network tomography to monitor failures. We outline an approach for selecting paths to monitor, detecting and confirming th...
Yiyi Huang, Nick Feamster, Renata Teixeira
ICMCS
2006
IEEE
119views Multimedia» more  ICMCS 2006»
16 years 21 days ago
Adaptive Multimedia Flow Regulation and Delay Analysis for End-Hosts in P2P Networks
This paper proposes a novel adaptive algorithm based on a new soft-regulator (σ, ρ, λ) for concurrent multimedia flows at end hosts. Our algorithm has the following features: ...
Weijia Jia
NN
2002
Springer
144views Neural Networks» more  NN 2002»
15 years 6 months ago
Projective ART for clustering data sets in high dimensional spaces
A new neural network architecture (PART) and the resulting algorithm are proposed to
Yongqiang Cao, Jianhong Wu
BMCBI
2008
131views more  BMCBI 2008»
15 years 6 months ago
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...
SPAA
2003
ACM
15 years 12 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...