Sciweavers

212 search results - page 11 / 43
» Foundations of Group Signatures: The Case of Dynamic Groups
Sort
View
CF
2005
ACM
13 years 9 months ago
Exploiting processor groups to extend scalability of the GA shared memory programming model
Exploiting processor groups is becoming increasingly important for programming next-generation high-end systems composed of tens or hundreds of thousands of processors. This paper...
Jarek Nieplocha, Manojkumar Krishnan, Bruce Palmer...
DAM
2008
123views more  DAM 2008»
13 years 7 months ago
Ultrametrics, Banach's fixed point theorem and the Riordan group
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
Ana Luzón, Manuel A. Morón
ICNP
1999
IEEE
13 years 11 months ago
Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol
While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must su...
Sylvia Ratnasamy, Steven McCanne
AI
2010
Springer
13 years 7 months ago
A logic of delegation
Delegation is a foundational concept for understanding and engineering systems that interact and execute tasks autonomously. By extending recent work on tensed action logic, it be...
Timothy J. Norman, Chris Reed
COMCOM
2006
81views more  COMCOM 2006»
13 years 7 months ago
A case for tree evolution in QoS multicasting
The phenomenal growth of group communications and QoS-aware applications over the Internet have accelerated the development of multicasting technologies. The Core-Based Tree (CBT) ...
Anirban Chakrabarti, G. Manimaran