Sciweavers

3652 search results - page 15 / 731
» A study of query length
Sort
View
INDOCRYPT
2003
Springer
14 years 26 days ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
Tetsu Iwata, Kaoru Kurosawa
TLSDKCS
2010
13 years 2 months ago
Improving Retrievability and Recall by Automatic Corpus Partitioning
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
Shariq Bashir, Andreas Rauber
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
14 years 2 months ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
BMCBI
2011
12 years 11 months ago
Predicting mutually exclusive spliced exons based on exon length, splice site and reading frame conservation, and exon sequence
Background: Alternative splicing of pre-mature RNA is an important process eukaryotes utilize to increase their repertoire of different protein products. Several types of differen...
Holger Pillmann, Klas Hatje, Florian Odronitz, Bjo...
TREC
2001
13 years 9 months ago
Rutgers' TREC 2001 Interactive Track Experience
Our focus this year was to investigate methods for increasing query length in interactive information searching in the Web context, and to see if these methods led to changes in t...
Nicholas J. Belkin, Colleen Cool, J. Jeng, Amymari...