4795 search results - page 757 / 959 » The Message Classification Model |
105
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
93
Voted
PCM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper presents a prototype system, which synthesizes entertainment-oriented cartoon face and translates text message to multimedia animation in mobile phone. While a...
114
click to vote
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
127
Voted
SC
2004
ACM
15 years 8 months ago
2004
ACM
RPC is one of the programming models envisioned for the Grid. In Internet connected Large Scale Grids such as Desktop Grids, nodes and networks failures are not rare events. This ...
104
Voted
GC
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...