Sciweavers

1055 search results - page 94 / 211
» Performance Analysis of Generalized Multihop Shuffle Network...
Sort
View
CCS
2008
ACM
15 years 5 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...
PE
2007
Springer
140views Optimization» more  PE 2007»
15 years 3 months ago
Stochastic analysis of file-swarming systems
File swarming (or file sharing) is one of the most important applications in P2P networks. In this paper, we propose a stochastic framework to analyze a file swarming system und...
Minghong Lin, Bin Fan, John C. S. Lui, Dah-Ming Ch...
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 6 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
IJCNN
2000
IEEE
15 years 8 months ago
Hardware Implementation of a PCA Learning Network by an Asynchronous PDM Digital Circuit
We have fabricated a PCA (Principal Component Analysis) learning network in a FPGA (Field Programmable Gate Array) by using an asynchronous PDM (Pulse Density Modulation) digital ...
Yuzo Hirai, Kuninori Nishizawa
EPIA
2009
Springer
15 years 10 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...