119 search results - page 5 / 24 » Two Structural Results for Low Degree Polynomials and Applic... |
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
ISPDC
2007
IEEE
15 years 4 months ago
2007
IEEE
The task management is a key point in grid applications and can highly influence their efficiency. There are many solutions that we can classify according to their centralizatio...
CVPR
2006
IEEE
15 years 12 months ago
2006
IEEE
We develop theory and algorithms to incorporate image manifold constraints in a level set segmentation algorithm. This provides a framework to simultaneously segment every image o...
143
click to vote
IWPEC
2010
Springer
14 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...