Sciweavers

972 search results - page 66 / 195
» Performance of data networks with random links
Sort
View
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
15 years 7 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...
P2P
2010
IEEE
207views Communications» more  P2P 2010»
15 years 4 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ICCAD
2006
IEEE
122views Hardware» more  ICCAD 2006»
16 years 3 months ago
Network coding for routability improvement in VLSI
With the standard approach for establishing multicast connections over a network, network nodes are utilized to forward and duplicate the packets received over the incoming links....
Nikhil Jayakumar, Sunil P. Khatri, Kanupriya Gulat...
IJCNN
2000
IEEE
15 years 9 months ago
A Training Method with Small Computation for Classification
A training data selection method for multi-class data is proposed. This method can be used for multilayer neural networks (MLNN). The MLNN can be applied to pattern classification...
Kazuyuki Hara, Kenji Nakayama
COMSWARE
2007
IEEE
16 years 13 days ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra