Sciweavers

828 search results - page 89 / 166
» Simplicial Powers of Graphs
Sort
View
WWW
2005
ACM
14 years 8 months ago
PageRank as a function of the damping factor
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
IM
2007
13 years 7 months ago
PageRank of Scale-Free Growing Networks
PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of Web page visits by a random surfer and thus it r...
Konstantin Avrachenkov, Dmitri Lebedev
CONEXT
2010
ACM
13 years 5 months ago
Assessing the vulnerability of replicated network services
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
George Dean Bissias, Brian Neil Levine, Ramesh K. ...
DATE
2009
IEEE
131views Hardware» more  DATE 2009»
14 years 2 months ago
Communication minimization for in-network processing in body sensor networks: A buffer assignment technique
—Body sensor networks are emerging as a promising platform for healthcare monitoring. These systems are composed of battery-operated embedded devices which process physiological ...
Hassan Ghasemzadeh, Nisha Jain, Marco Sgroi, Roozb...
ASAP
2007
IEEE
144views Hardware» more  ASAP 2007»
14 years 2 months ago
A High-Throughput Programmable Decoder for LDPC Convolutional Codes
In this paper, we present and analyze a novel decoder architecture for LDPC convolutional codes (LDPCCCs). The proposed architecture enables high throughput and can be programmed ...
Marcel Bimberg, Marcos B. S. Tavares, Emil Mat&uac...