Sciweavers

198 search results - page 20 / 40
» Weak Probabilistic Anonymity
Sort
View
JSS
2002
96views more  JSS 2002»
13 years 8 months ago
A group signature scheme with strong separability
Group signatures, introduced by Chaum and van Heijst, allow members of a group to sign messages anonymously on behalf of the group. Only a designated group manager is able to iden...
Shundong Xia, Jinyuan You
DAC
1996
ACM
14 years 1 months ago
A New Hybrid Methodology for Power Estimation
1 In this paper, we propose a hybrid approach for estimating the switching activities of the internal nodes in logic circuits. The new approach combines the advantages of the simul...
David Ihsin Cheng, Kwang-Ting Cheng, Deborah C. Wa...
PRL
2011
13 years 4 months ago
Object recognition using proportion-based prior information: Application to fisheries acoustics
: This paper addresses the inference of probabilistic classification models using weakly supervised learning. The main contribution of this work is the development of learning meth...
Riwal Lefort, Ronan Fablet, Jean-Marc Boucher
WPES
2006
ACM
14 years 3 months ago
Nonesuch: a mix network with sender unobservability
Oblivious submission to anonymity systems is a process by which a message may be submitted in such a way that neither the anonymity network nor a global passive adversary may dete...
Thomas S. Heydt-Benjamin, Andrei Serjantov, Beness...
ICCV
2005
IEEE
14 years 11 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu