Sciweavers

3175 search results - page 403 / 635
» Network properties of folksonomies
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win
ENTCS
2008
89views more  ENTCS 2008»
15 years 6 months ago
Dataflow Architectures for GALS
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla
FCSC
2008
104views more  FCSC 2008»
15 years 6 months ago
On automatic verification of self-stabilizing population protocols
The population protocol model [2] has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with e...
Jun Pang, Zhengqin Luo, Yuxin Deng
CN
2006
81views more  CN 2006»
15 years 6 months ago
On the universality of rank distributions of website popularity
We present an extensive analysis of long-term statistics of the queries to websites using logs collected on several web caches in Russian academic networks and on US IRCache cache...
Serge A. Krashakov, Anton B. Teslyuk, Lev N. Shchu...
CPC
2006
73views more  CPC 2006»
15 years 6 months ago
Feasible Schedules for Rotating Transmissions
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...
Noga Alon