Sciweavers

534 search results - page 29 / 107
» Power from Random Strings
Sort
View
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 8 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
LATIN
2004
Springer
14 years 3 months ago
On the (Im)possibility of Non-interactive Correlation Distillation
We study the problem of non-interactive correlation distillation (NICD). Suppose Alice and Bob each has a string, denoted by A = a0a1 · · · an−1 and B = b0b1 · · · bn−1,...
Ke Yang
ICCV
2003
IEEE
14 years 11 months ago
Discriminative Random Fields: A Discriminative Framework for Contextual Interaction in Classification
In this work we present Discriminative Random Fields (DRFs), a discriminative framework for the classification of image regions by incorporating neighborhood interactions in the l...
Sanjiv Kumar, Martial Hebert
ITCC
2005
IEEE
14 years 3 months ago
AES Power Attack Based on Induced Cache Miss and Countermeasure
This paper presents a new attack against a software implementation of the Advanced Encryption Standard. The attack aims at flushing elements of the SBOX from the cache, thus indu...
Guido Bertoni, Vittorio Zaccaria, Luca Breveglieri...
ICDE
2001
IEEE
106views Database» more  ICDE 2001»
14 years 11 months ago
Querying XML Documents Made Easy: Nearest Concept Queries
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
Albrecht Schmidt 0002, Martin L. Kersten, Menzo Wi...