925 search results - page 57 / 185 » Connectivity on Complete Lattices |
102
click to vote
CRYPTO
2011
Springer
13 years 11 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
Misregistration between the color separations of a printed image, which is often inevitable, can cause objectionable color shifts in average color. We analyze the impact of inter-...
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
ASAP
2008
IEEE
15 years 6 months ago
2008
IEEE
NTRU is a public-key cryptosystem based on the shortest vector problem in a lattice which is an alternative to RSA and ECC. This work presents a compact and low power NTRU design ...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper focuses on a solution to better adapt ASR systems, whose language models (LM) are usually trained on topic-independent corpora, to new topics, in particular in the case...