193 search results - page 32 / 39 » Members of Random Closed Sets |
IWQOS
2005
Springer
14 years 28 days ago
2005
Springer
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
ACMSE
2004
ACM
14 years 26 days ago
2004
ACM
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
EDCC
2010
Springer
14 years 6 days ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Linked or networked data are ubiquitous in many applications. Examples include web data or hypertext documents connected via hyperlinks, social networks or user profiles connected...