Sciweavers

616 search results - page 51 / 124
» Decoding One Out of Many
Sort
View
SPIRE
2010
Springer
13 years 6 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi
FIW
2009
120views Communications» more  FIW 2009»
13 years 6 months ago
Software Security Vulnerabilities Seen As Feature Interactions
The security of software applications is an important domain, and one that mixes formalisms (e.g. when dealing with cryptography and security protocols) with very ad hoc, low level...
Guy-Vincent Jourdan
COLING
1996
13 years 9 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
CRYPTO
2004
Springer
128views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Faster Correlation Attack on Bluetooth Keystream Generator E0
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
Yi Lu 0002, Serge Vaudenay
ISCA
2010
IEEE
185views Hardware» more  ISCA 2010»
14 years 1 months ago
Dynamic warp subdivision for integrated branch and memory divergence tolerance
SIMD organizations amortize the area and power of fetch, decode, and issue logic across multiple processing units in order to maximize throughput for a given area and power budget...
Jiayuan Meng, David Tarjan, Kevin Skadron