Sciweavers

13966 search results - page 2453 / 2794
» The Internet a
Sort
View

Publication
203views
15 years 6 months ago
Multigraph Sampling of Online Social Networks
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
Minas Gjoka, Carter T. Butts, Maciej Kurant, Athin...
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 6 months ago
System Virtualization and Efficient ID Transmission Method for RFID Tag Infrastructure Network
The use of RFID tag which identifies a thing and an object will be expanded with progress of ubiquitous society, and it is necessary to study how to construct RFID network system ...
Shin-ichi Kuribayashi
CPHYSICS
2010
88views more  CPHYSICS 2010»
15 years 6 months ago
Distributed computing as a virtual supercomputer: Tools to run and manage large-scale BOINC simulations
Distributed computing (DC) projects tackle large computational problems by exploiting the donated processing power of thousands of volunteered computers, connected through the Int...
Toni Giorgino, Matt J. Harvey, Gianni De Fabritiis
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 6 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
« Prev « First page 2453 / 2794 Last » Next »