Sciweavers

3552 search results - page 348 / 711
» Proof theory in the abstract
Sort
View
COLT
2010
Springer
15 years 4 months ago
Characterization of Linkage-based Clustering
Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification ta...
Margareta Ackerman, Shai Ben-David, David Loker
TPHOL
2005
IEEE
16 years 10 days ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
ISW
2004
Springer
16 years 4 days ago
Low-Level Ideal Signatures and General Integrity Idealization
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
Michael Backes, Birgit Pfitzmann, Michael Waidner
KBSE
2000
IEEE
15 years 10 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
JOC
2010
82views more  JOC 2010»
15 years 1 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth