Sciweavers

5056 search results - page 465 / 1012
» Network Coding Theory
Sort
View
DCC
2006
IEEE
16 years 4 months ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey
PPOPP
2010
ACM
16 years 2 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
CCS
2007
ACM
15 years 11 months ago
Program obfuscation: a quantitative approach
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
Bertrand Anckaert, Matias Madou, Bjorn De Sutter, ...
HICSS
2005
IEEE
155views Biometrics» more  HICSS 2005»
15 years 10 months ago
Framework for Governance in Open Source Communities
In recent years, the development of software in open source communities has attracted immense attention from research and practice. The idea of commercial quality, free software, ...
Christoph Lattemann, Stefan Stieglitz
139
Voted
SIGECOM
2005
ACM
130views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
Graceful service degradation (or, how to know your payment is late)
When distributing digital content over a broadcast channel it’s often necessary to revoke users whose access privileges have expired, thus preventing them from recovering the co...
Alexandr Andoni, Jessica Staddon