53 search results - page 3 / 11 » Dualities in full homomorphisms |
JSYML
2010
14 years 6 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
100
click to vote
IJISEC
2006
14 years 11 months ago
2006
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
MOC
2000
14 years 11 months ago
2000
The lifting of results from factor groups to the full group is a standard technique for solvable groups. This paper shows how to utilize this approach in the case of non-solvable n...
119
click to vote
CONCUR
1992
Springer
15 years 3 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
150
click to vote
CMS
2011
13 years 11 months ago
2011
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...