Sciweavers

144 search results - page 20 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
ASIACRYPT
2009
Springer
14 years 2 months ago
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...
Jonathan Katz, Vinod Vaikuntanathan
MST
2006
136views more  MST 2006»
13 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
CVPR
2005
IEEE
14 years 9 months ago
Damped Newton Algorithms for Matrix Factorization with Missing Data
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
A. M. Buchanan, Andrew W. Fitzgibbon
ICML
2009
IEEE
14 years 8 months ago
Uncertainty sampling and transductive experimental design for active dual supervision
Dual supervision refers to the general setting of learning from both labeled examples as well as labeled features. Labeled features are naturally available in tasks such as text c...
Vikas Sindhwani, Prem Melville, Richard D. Lawrenc...
GLOBECOM
2010
IEEE
13 years 5 months ago
Differential Cooperative Communications with Space-Time Network Coding
Abstract--In multinode cooperative communications, simultaneous transmissions from two or more nodes are challenging due to its asynchronous nature. In addition, channel estimation...
Zhenzhen Gao, Hung-Quoc Lai, K. J. Ray Liu