Sciweavers

145 search results - page 14 / 29
» The Maximum Distinguishing Number of a Group
Sort
View
CCS
2005
ACM
15 years 3 months ago
On fairness in simulatability-based cryptographic systems
Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simula...
Michael Backes, Dennis Hofheinz, Jörn Mü...
CSDA
2006
91views more  CSDA 2006»
14 years 9 months ago
Model-based cluster and discriminant analysis with the MIXMOD software
The mixmod (mixture modeling) program fits mixture models to a given data set for the purposes of density estimation, clustering or discriminant analysis. A large variety of algor...
Christophe Biernacki, Gilles Celeux, Gérard...
CCR
1999
56views more  CCR 1999»
14 years 9 months ago
MPEG transmission schemes for a timed token medium access control network
This paper presents three transmission schemes to improve the transmission of MPEG video over a timed token medium access control (MAC) network. Multiple classes of MPEG video are...
Joseph Kee-Yin Ng
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
15 years 2 months ago
Balanced Batch LKH: New Proposal, Implementation and Performance Evaluation
Perfect Secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A Key Server must ...
Josep Pegueroles, Francisco Rico-Novella
SIGMOD
2005
ACM
97views Database» more  SIGMOD 2005»
15 years 9 months ago
Incognito: Efficient Full-Domain K-Anonymity
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes that clearly identify individuals, such as Name and So...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...