Sciweavers

416 search results - page 28 / 84
» Enough of Processes - Lets do Practices
Sort
View
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
15 years 3 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
ICCS
2004
Springer
15 years 3 months ago
Types and Tokens for Logic with Diagrams
It is well accepted that diagrams play a crucial role in human reasoning. But in mathematics, diagrams are most often only used for visualizations, but it is doubted that diagrams ...
Frithjof Dau
CIKM
2009
Springer
15 years 1 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
AAAI
2006
14 years 11 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
JCM
2006
112views more  JCM 2006»
14 years 9 months ago
A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis
The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that user...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...