Sciweavers

903 search results - page 80 / 181
» On the reduction of a random basis
Sort
View
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
15 years 11 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
COCOON
1998
Springer
15 years 10 months ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer
FOCS
2004
IEEE
15 years 10 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
PR
2007
129views more  PR 2007»
15 years 5 months ago
EROS: Ensemble rough subspaces
Ensemble learning is attracting much attention from pattern recognition and machine learning domains for good generalization. Both theoretical and experimental researches show tha...
Qinghua Hu, Daren Yu, Zongxia Xie, Xiaodong Li
ICML
2009
IEEE
16 years 1 months ago
Feature hashing for large scale multitask learning
Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation. In this paper we provide exponential tail bo...
Kilian Q. Weinberger, Anirban Dasgupta, John Langf...