DAGSTUHL
2007
13 years 7 months ago
2007
Abstract. We propose a new matrix learning scheme to extend Generalized Relevance Learning Vector Quantization (GRLVQ). By introducing a full matrix of relevance factors in the dis...
DAGSTUHL
2007
13 years 7 months ago
2007
Abstract. The sharing of content by communities of users (e.g., scientists) in a P2P context remains cumbersome. We argue that main reasons for this is the lack of calculus and alg...
DAGSTUHL
2007
13 years 7 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
DAGSTUHL
2007
13 years 7 months ago
2007
DAGSTUHL
2007
13 years 7 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
DAGSTUHL
2007
13 years 7 months ago
2007
—An electronic voting system may be said to be composed by a number of components, each of which has a number of properties. One of the most attractive effects of this way of thi...
DAGSTUHL
2007
13 years 7 months ago
2007
Voting in uncontrolled environments, such as the Internet comes with a price, the price of having to trust in uncontrolled machines the collection of voter’s vote. An uncontrolle...
DAGSTUHL
2007
13 years 7 months ago
2007
DAGSTUHL
2007
13 years 7 months ago
2007
Civitas is the first implementation of a coercion-resistant, universally verifiable, remote voting scheme. This paper describes the design of Civitas, details the cryptographic ...
DAGSTUHL
2007
13 years 7 months ago
2007
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...