2414 search results - page 24 / 483 » Computing Normal Subgroups |
SGP
2007
13 years 10 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We introduce a new shape normalization method based on implicit shape representations. The proposed method is robust with respect to deformations and invariant to similarity trans...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Recently, the interest about the Tate pairing over binary fields has decreased due to the existence of efficient attacks to the discrete logarithm problem in the subgroups of su...
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
TCS
2011
13 years 2 months ago
2011
A new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suit...