Sciweavers

444 search results - page 27 / 89
» Question Answering for Dutch Using Dependency Relations
Sort
View
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
AES
2004
Springer
139views Cryptology» more  AES 2004»
14 years 1 months ago
The Inverse S-Box, Non-linear Polynomial Relations and Cryptanalysis of Block Ciphers
This paper is motivated by the design of AES. We consider a broader question of cryptanalysis of block ciphers having very good non-linearity and diffusion. Can we expect anyway, ...
Nicolas Courtois
ASIACRYPT
2000
Springer
13 years 12 months ago
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
An authenticated encryption scheme is a symmetric encryption scheme whose goal is to provide both privacy and integrity. We consider two possible notions of authenticity for such ...
Mihir Bellare, Chanathip Namprempre
JSYML
2007
75views more  JSYML 2007»
13 years 7 months ago
Stable definability and generic relations
Abstract. An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the φ-definitions of p ...
Byunghan Kim, Rahim Moosa
JSS
2006
128views more  JSS 2006»
13 years 7 months ago
Automatic generation of document semantics for the e-science Knowledge Grid
This paper proposes an approach to automatically generate semantics for scientific e-documents, and presents its applications in e-document understanding, question answering and q...
Hai Zhuge, Xiangfeng Luo