Sciweavers

845 search results - page 30 / 169
» Diagnosabilities of regular networks
Sort
View
ISNN
2007
Springer
14 years 2 months ago
Regularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...
Andrzej Cichocki, Rafal Zdunek
EJC
2008
13 years 8 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
NOMS
2008
IEEE
132views Communications» more  NOMS 2008»
14 years 2 months ago
DYSWIS: An architecture for automated diagnosis of networks
As the complexity of networked systems increases, we need mechanisms to automatically detect failures in the network and diagnose the cause of such failures. To realize true self-...
Vishal Kumar Singh, Henning Schulzrinne, Kai Miao
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
14 years 1 months ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu
TMC
2011
203views more  TMC 2011»
13 years 2 months ago
Throughput Optimization in Mobile Backbone Networks
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
Emily M. Craparo, Jonathan P. How, Eytan Modiano