Sciweavers

40212 search results - page 7836 / 8043
» More
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 2 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
SCN
2010
Springer
176views Communications» more  SCN 2010»
15 years 2 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi
SCN
2010
Springer
138views Communications» more  SCN 2010»
15 years 2 months ago
A Security Enhancement and Proof for Authentication and Key Agreement (AKA)
In this work, we consider Authentication and Key Agreement (AKA), a popular client-server Key Exchange (KE) protocol, commonly used in wireless standards (e.g., UMTS), and widely c...
Vladimir Kolesnikov
SDM
2010
SIAM
217views Data Mining» more  SDM 2010»
15 years 2 months ago
Collaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs
Collaborative filtering is an important topic in data mining and has been widely used in recommendation system. In this paper, we proposed a unified model for collaborative fil...
Quanquan Gu, Jie Zhou, Chris H. Q. Ding
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
15 years 2 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
« Prev « First page 7836 / 8043 Last » Next »