Sciweavers

4303 search results - page 31 / 861
» Are We There Yet
Sort
View
CRYPTO
1994
Springer
128views Cryptology» more  CRYPTO 1994»
14 years 3 months ago
Linear Cryptanalysis Using Multiple Approximations
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limit...
Burton S. Kaliski Jr., Matthew J. B. Robshaw
SYNTHESE
2008
81views more  SYNTHESE 2008»
13 years 10 months ago
Decision framing in judgment aggregation
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
Fabrizio Cariani, Marc Pauly, Josh Snyder
SIGMOD
2003
ACM
102views Database» more  SIGMOD 2003»
14 years 11 months ago
Analysis of SIGMOD's co-authorship graph
In this paper we investigate the co-authorship graph obtained from all papers published at SIGMOD between 1975 and 2002. We find some interesting facts, for instance, the identity...
Mario A. Nascimento, Jörg Sander, Jeffrey Pound
ML
2002
ACM
223views Machine Learning» more  ML 2002»
13 years 10 months ago
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
The choice of the kernel function is crucial to most applications of support vector machines. In this paper, however, we show that in the case of text classification, term-frequenc...
Edda Leopold, Jörg Kindermann
AISC
2000
Springer
14 years 3 months ago
Reasoning about the Elementary Functions of Complex Analysis
There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make “howlers” or not to simplify enough. In thi...
Robert M. Corless, James H. Davenport, David J. Je...