61 search results - page 6 / 13 » Probable Innocence Revisited |
CPC
2004
13 years 7 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
MOBICOM
2004
ACM
14 years 27 days ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
IACR
2011
12 years 7 months ago
2011
The hardware-attractive block cipher family KTANTAN was studied by Bogdanov and Rechberger who identified flaws in the key schedule and gave a meet-in-the-middle attack. We revis...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—Previous studies of receive diversity have carefully modeled the impact of spatial correlation and antenna coupling on the signal component at the receiver. By contrast, relativ...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...