Sciweavers

773 search results - page 101 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
ASIACRYPT
2009
Springer
16 years 15 days 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
COMPGEOM
2009
ACM
16 years 13 days ago
Persistent cohomology and circular coordinates
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...
Vin de Silva, Mikael Vejdemo-Johansson
IJCNN
2007
IEEE
16 years 6 days ago
Using Artificial Neural Networks and Feature Saliency Techniques for Improved Iris Segmentation
—One of the basic challenges to robust iris recognition is iris segmentation. This paper proposes the use of a feature saliency algorithm and an artificial neural network to perf...
Randy P. Broussard, Lauren R. Kennell, David L. So...
CIKM
2005
Springer
15 years 11 months ago
Feature-based recommendation system
The explosive growth of the world-wide-web and the emergence of e-commerce has led to the development of recommender systems—a personalized information filtering technology use...
Eui-Hong Han, George Karypis
ECCV
2010
Springer
15 years 11 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov