Sciweavers

1538 search results - page 77 / 308
» Relative Randomness and Cardinality
Sort
View
INFOCOM
2012
IEEE
13 years 8 days ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley
IPPS
2009
IEEE
15 years 4 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
SPW
2005
Springer
15 years 3 months ago
Enhancing Privacy with Shared Pseudo Random Sequences
Protecting users’ privacy is essential for turning networks and services into trustworthy friends. Many privacy enhancing techniques, such as anonymous e-cash and mix-nets, have...
Jari Arkko, Pekka Nikander, Mats Näslund
IIE
2006
101views more  IIE 2006»
14 years 9 months ago
Random Factors in IOI 2005 Test Case Scoring
We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the abilit...
Gordon V. Cormack
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 8 months ago
High-Throughput Random Access via Codes on Graphs
—Recently, contention resolution diversity slotted ALOHA (CRDSA) has been introduced as a simple but effective improvement to slotted ALOHA. It relies on MAC burst repetitions an...
Gianluigi Liva, Enrico Paolini, Marco Chiani