Sciweavers

3702 search results - page 24 / 741
» All Pairings Are in a Group
Sort
View
ECCC
2000
158views more  ECCC 2000»
15 years 5 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
NRHM
1998
124views more  NRHM 1998»
15 years 5 months ago
Adaptable and adaptive information provision for all users, including disabled and elderly people
: Due to the tremendously increasing popularity of the World-Wide Web, hypermedia is going to be the leading online information medium for some years to come and will most likely b...
Josef Fink, Alfred Kobsa, Andreas Nill
PAIRING
2009
Springer
117views Cryptology» more  PAIRING 2009»
16 years 19 days ago
Identity Based Group Signatures from Hierarchical Identity-Based Encryption
A number of previous papers explored the notion of identity-based group signature. We present a generic construction of identity-based group signatures. Our construction is based o...
Nigel P. Smart, Bogdan Warinschi
ACISP
2005
Springer
15 years 11 months ago
Dynamic Group Key Agreement in Tree-Based Setting
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We p...
Ratna Dutta, Rana Barua
IJCV
2007
138views more  IJCV 2007»
15 years 6 months ago
Correspondence-free Structure from Motion
We present a novel approach for the estimation of 3D-motion directly from two images using the Radon transform. The feasibility of any camera motion is computed by integrating over...
Ameesh Makadia, Christopher Geyer, Kostas Daniilid...