Sciweavers

278 search results - page 13 / 56
» Variants of Spreading Messages
Sort
View
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
14 years 8 months ago
Style mining of electronic messages for multiple authorship discrimination: first results
This paper considers the use of computational stylistics for performing authorship attribution of electronic messages, addressing categorization problems with as many as 20 differ...
Shlomo Argamon, Marin Saric, Sterling Stuart Stein
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
14 years 1 days ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
IJACT
2010
67views more  IJACT 2010»
13 years 2 months ago
On message recognition protocols: recoverability and explicit confirmation
: We look at message recognition protocols (MRPs) and prove that there is a oneto-one correspondence between stateless non-interactive MRPs and digital signature schemes. Next, we ...
Ian Goldberg, Atefeh Mashatan, Douglas R. Stinson
VLDB
1993
ACM
84views Database» more  VLDB 1993»
13 years 11 months ago
A New Presumed Commit Optimization for Two Phase Commit
Two phase commit (ZPC) ia used to coordinate the commitment of trunsactiom in distributed systems. The standard 2PC optimization is the presumed abort variant, which wea fewer mes...
Butler W. Lampson, David B. Lomet
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri