Sciweavers

532 search results - page 20 / 107
» Graphically abelian groups
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 4 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
CIVR
2010
Springer
176views Image Analysis» more  CIVR 2010»
14 years 2 months ago
The effect of baroque music on the PassPoints graphical password
Graphical passwords have been demonstrated to be the possible alternatives to traditional alphanumeric passwords. However, they still tend to follow predictable patterns that are ...
Haichang Gao, Zhongjie Ren, Xiuling Chang, Xiyang ...
ICC
2008
IEEE
134views Communications» more  ICC 2008»
14 years 4 months ago
Non-Differential DSTBCs for Partially-Coherent Cooperative Communication
— In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward t...
Jagadeesh Harshan, B. Sundar Rajan
ESOP
1994
Springer
14 years 1 months ago
Dimension Types
Scientists and engineers must ensure that physical equations are dimensionally consistent, but existing programming languages treat all numeric values as dimensionless. This paper ...
Andrew Kennedy
ENDM
2008
114views more  ENDM 2008»
13 years 10 months ago
Strong oriented chromatic number of planar graphs without cycles of specific lengths
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
Mickaël Montassier, Pascal Ochem, Alexandre P...