Sciweavers

2610 search results - page 358 / 522
» Computational Probabilistic Non-interference
Sort
View
115
Voted
MM
2005
ACM
139views Multimedia» more  MM 2005»
15 years 9 months ago
Multimodal affect recognition in learning environments
We propose a multi-sensor affect recognition system and evaluate it on the challenging task of classifying interest (or disinterest) in children trying to solve an educational pu...
Ashish Kapoor, Rosalind W. Picard
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 9 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
138
Voted
DIS
2009
Springer
15 years 7 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
134
Voted
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 7 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
3DOR
2008
15 years 6 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf