305 search results - page 14 / 61 » From Sets to Bits in Coq |
108
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
TCSV
2002
14 years 10 months ago
2002
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...
ICIP
2002
IEEE
16 years 10 days ago
2002
IEEE
Compared to a geometric approach, image based rendering applied to 3D view reconstruction doesn't require 3D model construction and doesn't depend on the complexity of t...
100
click to vote
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...
RSA
1998
14 years 10 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...