Sciweavers

7773 search results - page 115 / 1555
» On generalized Frame-Stewart numbers
Sort
View
SIGMOD
2005
ACM
97views Database» more  SIGMOD 2005»
15 years 10 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...
ASIACRYPT
2000
Springer
15 years 2 months ago
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
Shiho Moriai, Serge Vaudenay
ICML
2006
IEEE
15 years 10 months ago
Fast particle smoothing: if I had a million particles
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
Mike Klaas, Mark Briers, Nando de Freitas, Arnaud ...
SAC
2010
ACM
15 years 4 months ago
Quality and perceived usefulness of process models
Modeling is now an essential ingredient in business process management and information systems development. The general usefulness of models in these areas is therefore generally ...
Peter Rittgen
COMSWARE
2008
IEEE
15 years 4 months ago
Deterministic schemes for key distribution in wireless sensor networks
— In this paper, we propose a new security metric for measuring resilience of a symmetric key distribution scheme in wireless sensor network. A polynomial-based and a novel compl...
Abhishek Gupta, Joy Kuri