Sciweavers

108 search results - page 10 / 22
» cn 2010
Sort
View
150
Voted
CN
2010
146views more  CN 2010»
15 years 3 months ago
Badumna: A decentralised network engine for virtual environments
Many of today's virtual environment applications, such as massively multi-player online games, involve a large and rapidly changing set of users. The server-based architectur...
Santosh Kulkarni, Scott Douglas, David Churchill
148
Voted
PPOPP
2010
ACM
16 years 27 days ago
Applying the concurrent collections programming model to asynchronous parallel dense linear algebra
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...
Aparna Chandramowlishwaran, Kathleen Knobe, Richar...
120
Voted
CN
2010
83views more  CN 2010»
15 years 3 months ago
Secure peer sampling
PuppetCast is a protocol for secure peer sampling in large-scale distributed systems. A peer sampling protocol continuously provides each node in the system with a uniform random ...
Gian Paolo Jesi, Alberto Montresor, Maarten van St...
145
Voted
CN
2010
107views more  CN 2010»
15 years 1 months ago
Secure multicast in IPTV services
Technological evolution is leading telecommunications to all-IP networks where multiple services are transported as IP packets. Among these are the group communications services w...
António Pinto, Manuel Ricardo
141
Voted
CPC
2010
144views more  CPC 2010»
15 years 1 months ago
What Does a Random Contingency Table Look Like?
Let R = (r1, . . . , rm) and C = (c1, . . . , cn) be positive integer vectors such that r1 + . . . + rm = c1 + . . . + cn. We consider the set (R, C) of non-negative m
Alexander I. Barvinok